advent-of-code-2021 VS AdventOfCode2021.jl

Solution

Day 3 of AoC, and it's starting to get harder. I'm actually not sure about the time complexity on this one. I saw some algorithms that apparently are O(n * l), where l is the length of the binary number. I believe my implementation is O(n * logn), but I'm not sure how much slower or faster it would actually be in reality. I'd appreciate more insight on this.

Link

With the permission of mods, I will try to make a daily post about Advent of Code, where we can share our solutions and talk about AoC in general. This is my solution for day 2. I'm liking the submarine theme so far, and the visualizations on /r/adventofcode are really awesome. I was thinking about doing some in OpenGL, but I don't know if I can bear the pain. How are you liking AoC so far?

I hope this kind of post is allowed. I'm planning to do this year's Advent of Code all in C (and hopefully all in time). This is what I ended up with for Day 1. I'm posting this so we can compare and improve our solutions.

I've also tried to write pretty efficient code for the 2021 Advent of Code challenge, but in Julia (https://github.com/goggle/AdventOfCode2021.jl). I would like to run your benchmarks on my local machine. Any chance you could help me (I'm a rust noob...)?

Link to the repository: https://github.com/goggle/AdventOfCode2021.jl