coding-problems VS aoc2022

Anyways here's the very messy original code

You can even take that one step further and calculate all paths to as in one go. My Python implementation of that runs in < 10 ms, C++ is at 20 µs.

Full code here.

Calculate part 1 in one pass and do a second only over the sizes for part 2 (because we know the size of / only at the very end). Hot runs take ~13 µs on a Core i9-12900K, including I/O. Code is here.

I coded it up in C++ here. Hot runs take ~5 µs on a Core i9-12900K (both parts, including I/O).

Most of the time is spent parsing, but this problem lends itself nicely to a SIMD formulation, which using vectorclass doesn't even require detailed knowledge of the intrinsics. Hot runs take ~14 µs on a Core i9-12900K, including I/O. Full code is (here)[https://github.com/ahans/aoc2022/blob/main/cpp/day04.cc], the interesting part is this, where we process 32 elements at once:

Inspired by somebody here solving it in CMake, I tried some Bazel misuse. Full solution here. When run, it looks like this: