AdventOfCode2022CSharp VS advent-of-code-2022

C# solution using .NET Interactive and Jupyter Notebook. Used a recursive drop function to simulate a single grain of sand falling. Part 2 is not particularly efficient (~600ms). I went with a brute force approach solving it the same way as Part 1. But saw some clever "ray-casting" methods here in the comments!

C# solution using .NET Interactive and Jupyter Notebook. A bit of a tricky one today. Like many, used JSON parsing using the new System.Text.Json library. Then used a custom Comparer for the OrderBy LINQ method for Part 2.

C# solution using .NET Interactive and Jupyter Notebook. Part 1 was pretty straight forward by creating my own Monkey class. For Part 2, had to get some hints here on how to manage the very big numbers.

C# solution using .NET Interactive and Jupyter Notebook. Created an IEnumerable that yield returns the register value during the cycle (made the mistake of returning the value at the end of the cycle at first). Then used LINQ on the Enumerable to solve Part 1 and 2.

C# solution using .NET Interactive and Jupyter Notebook.

nice one! you can make it even faster by creating a compile time multiplication table as i have done here, so all that happens at runtime is the bucketing of similarly aged fish, 7 multiplications + a sum

you've still got some overhead in your code, my rust solution creates a dense lookup array at runtime & takes ~200us on my 10850k. are you including file IO and printing to stdout?

code

full solution