Heavily optimized solutions in Rust using lots of unsafe.
Build and run benchmarks with cargo run --release -- --all.
It expects the input to be in ../dayXX/input.txt as provided in this repo.
Alternatively you can provide a directory with input files using --input-directory <DIR> in which case input files are expected at <DIR>/dayXX.txt.
You can provide expected results in a file expected.txt in the current or input directory or using --expected-file <FILE>. The expected format is one line per day with any whitespace separating the result for part 1 and 2.
All options:
-a/--all: Benchmark all days.-d <DAY>/--day <DAY>: Benchmark a single day.-i <NUM>/--iterations <NUM>: Number of iterations between timings.--no-check: Don't check if results are correct.--input-directory <DIR>: Directory for inputs. See above.--expected-file <FILE>: File for expected inputs. Defaults toexpected.txt.
The timings don't include reading the file into a string but include input parsing.
The solutions ignore any edge-cases not found in official inputs and heavily exploit any patterns found in them. Before execution, the read inputs are safety checked to avoid undefined behavior but any inputs that are safe but don't follow the expected patterns may produce wildy incorrect results.
For part 2, when comparing 3-value windows, it's enough to compare the first value of the first window with the last value of the last window since the respective other two values are the same.
Nothing interesting going on here.
These are doable very quickly (< 3 seconds). For each board, figure out what time it wins at. By building a map of called number -> time it's called, you can determine this very quickly. For each board, take maximum across each row/column, take minimum of those maxima.
- https://www.reddit.com/r/adventofcode/comments/r9hpfs/2021_day_5_bigger_vents/hnf8obo/?context=3
- https://www.reddit.com/r/adventofcode/comments/r9zwj0/2021_day_5_unofficial_part_4_100000_long_vents/
- https://www.reddit.com/r/adventofcode/comments/ratue0/2021_day_6_fricas_solution_via_finding_a/
- https://www.reddit.com/r/adventofcode/comments/rd7feu/day_6_closed_solution_with_an_exponential_function/
Part 1's target is the mean.
Part 2's target is ceil((sum(crabs) - sum(c < mean for c in crabs)) / len(crabs)).