aoc VS advent-of-code-2021

While I agree four minutes is very quick, if you take into account that no side fits with more than one other side, and that the sides (#, .) may just as well be interpreted as binary numbers, it becomes an issue of parsing, mostly, and then matching numbers.

I remember being flabbergasted at first, and then realizing the above. My solution is here:

https://github.com/linus/aoc/blob/main/2020/js/day-20/app.js

Some very interesting advent of code contributions written in Rust, available on github, use bitwise operations. Shout out to Tim Visee! https://github.com/timvisee/advent-of-code-2021/blob/master/...

This may be the closest thing I've personally seen: https://github.com/timvisee/advent-of-code-2021

Part 2 0.022ms (22μs)

Part 1 1.05ms

Part 1 0.861ms (861μs)

See https://github.com/timvisee/advent-of-code-2021/blob/master/runner/src/bin/bench.rs

Part 1 0.0027ms (2.7μs)

The orientation calculation could be done by matrix indexes operations https://github.com/FlakM/aoc2021/blob/main/day5/task1/src/main.rs and then its easier to create ranges. You can also use some clever crates and get some calculations for free https://github.com/timvisee/advent-of-code-2021/blob/master/day05b/src/main.rs