adventOfCode VS advent-of-code

Witness the weirdness for yourself at this here link: https://github.com/codemicro/adventOfCode/tree/master/challenges/2021/22-reactorReboot (includes screenshots)

I just did simple BFS on the lava cubes for part 1. For part 2, I just did a BFS on the bounding cube. Total runtime - 500 micro seconds for both parts on my 8 years old laptop: https://github.com/SvetlinZarev/advent-of-code/blob/main/2022/aoc-day-18/src/lib.rs

My solution is pretty simple - top down DP. On each step we can do only one of two things: * open a valve and stay in current position * do not open a vale, but move to a different positions

🦀🦀🦀 RUST 🦀🦀🦀

Rust

Here are the results of my benchmarks, which you can also run

You can calculate the distances between the points found by each scanner. If two scanners report points with the same distance between them, then most probably they are adjacent. Runs in 4ms on my machine: https://github.com/SvetlinZarev/advent-of-code/tree/main/2021/aoc-day-19

You can copy the release profile from here https://github.com/SvetlinZarev/advent-of-code/blob/main/2021/aoc-day-25/Cargo.toml#L8 and copy that directory to enable compilation for the machine's cpu https://github.com/SvetlinZarev/advent-of-code/tree/main/2021/aoc-day-25/.cargo

Mine (rust)runs for 50ms for both parts. I've used just a regular bruteforce approach, so nothing fancy. There are several things I did that reduced the execution time:

Compile for your CPU. By default rustc compiles for a generic CPU (i.e. a very very old x64), so the compiler does not use all the features availabl ein modern processors. Just add this in your project and you'll get several % improvement.

RUST