aoc VS adventofcode

Its not amazingly clear code, but here it is for what its worth: https://github.com/vodik/aoc/blob/main/aoc-2021/src/day23.rs

Rust

With this, I managed to achieve a solution that's 6-7µs for part1 and ~10-11µs for part2 in Rust.

Here is my solution: https://github.com/fireduck64/adventofcode/blob/master/2015/07/src/Prob.java

Java 25/38 https://github.com/fireduck64/adventofcode/blob/master/2021/24/src/Prob.java This involved a recursive sweep through the model number space while memoizing on the current register values. Basically, after the model number parts are read they don't matter for the recursion so the only state is the register values and the execution line number. So the memoization was able to actually help. Although, to be honest my solution for part 1 only worked because the number was near where I started the search (9s on down) and the part 2 only worked because I guessed (correctly) that the first number was still a nine because I'm on to how much Eric likes to punish us. Execution time around 2 minutes.