AdventOfCode2021_Julia VS aoc2021

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

I've been doing similar (in three langs, though Ive fallen behind on go and rust over the past few days) -- https://github.com/A-UNDERSCORE-D/aoc2021/blob/main/aoc/go/util/slice.go is most of my generic go fun, lots of implementations of higher order functions and nice wrappers

Python source

As usual, first implementation. Actually started by doing sum(range(1, steps+1)), and after solving remembered that theres a math thing for that (sum(0..n) = n * (n + 1) / 2). Nothing super fancy other than that. Code Finally starting to see speedup from pypy. That JIT is amazing but has its costs.

https://github.com/A-UNDERSCORE-D/aoc2021/blob/main/aoc/go/six/06.go -- Nothing super fancy. Nice ability to pick arrays over slices here though. Probably contributes a bit of speedup.