advent-of-code-2021 VS aoc2021

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

Go, 19196/19041

Go, 1093/563

Go, 2758/2421

Go, 631/732

Go 1449/3191

Go, 2400/1659

Go, 3030/3121

Oh also lost about 2-3 minutes on part A initially trying to use my challenge.TileMap so I didn't have to worry about computing x/y but converting to/from rune all the time was taking way too long and was hard to follow. Man, I can't wait until generics!

Go, 2815/3818

Go, 1730/3574