advent-of-code-2021 VS aoc

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

Rust, soluzione pulita: https://github.com/asdrubalini/advent-of-code/blob/2021/src/aoc/bingo.rs

I solved it using only iterators, map and filters. Also, there is a `tuple_windows` method already in the `itertools` crate (unless you are trying to solve without crates). Other than this, they look pretty similar :). If you want to compare with mine, here's the code: https://github.com/asdrubalini/advent-of-code/blob/2021/src/aoc/solutions.rs