AdventOfCode2021_Julia VS advent-of-code-wim

This has been a very fun year of puzzles. Looking forward to not having my alarm set for 05:45 in the morning any more. This year I've done everything in Julia to be fast (usually placed around 1000 for both parts), then trying to make nicer solutions in Rust later in the day, and then trying to make solutions in C, which this year meant that I would be implementing a Priority queue. The C repo is not quite complete. Missing a working solution for day 3 part 2 so far (Tried to be really big brain there, did not work out, and I haven't bothered going back yet), and day 23-25 is not yet completed. The rust repo should have working solutions for all days.

My part2_memo() solution here in julia runs in under 1ms timed with @btime.

After a bit of cleanup, mine is taking 230µs: https://github.com/MarcusTL12/AdventOfCode2021_Julia/blob/main/src/day9.jl

Thanks for the extra example. I've added it to my CI and test suite in https://github.com/wimglenn/advent-of-code-wim/pull/89

Full code here

I'm using Python so I'll never be as fast as the people using Rust or C, but am still able to solve most puzzles in under 1 second (repo: https://github.com/wimglenn/advent-of-code-wim).

Thanks for the kind words, well the source is here so you can just take a look. You have to run with var AOC_DEBUG=1 in env to enable the rendering.

I used an AStar pathfinder already prepared from earlier years (aoc2022/q12.py), just leaving the default null heuristic. If I understand correctly that is just a BFS.

https://github.com/wimglenn/advent-of-code-wim/blob/main/aoc_wim/ocr.py has nearly all the letters we've seen (including a larger font used once in 2018) although it is missing the 5-wide Y that was in my 2016-day 08 puzzle

By the way, I found that if you're willing to use pathlib and a guard, you actually only need 2 of those 6 case statements - it looks like this.

Python (repo). I was particularly pleased with how quick the parsing was.

Python + "AOCR" + complex numbers.

Python