AdventOfCode Alternatives

AdventOfCode reviews and mentions

• [2016 Day 14 (Part 2)][Python] Is there a trick to speed this up?
  1 project | /r/adventofcode | 9 Dec 2023

  Here's an example implementation in Rust, using rayon's parallel iterators to automatically distribute the computation of a range of hashes over all available cores. It solves both parts together in around 3 seconds on my M2 MacBook Pro. Single-threaded, it takes around 25s in Rust and 35s in Python.

• Need help finding good python solutions
  5 projects | /r/adventofcode | 6 Jul 2023

  Here are mine: https://github.com/benediktwerner/AdventOfCode

• [2022 All Days]
  5 projects | /r/adventofcode | 5 Jan 2023
• Running time goals (more of a survey question)
  3 projects | /r/adventofcode | 21 Dec 2022

  I love doing optimizations like this but I don't really have enough time anymore to really do it. In 2020 I spent a fair amount of time writing super optimized solutions for the first 10 or so days (repo solving all those days together in 150us i.e. <1ms) but even back then, I eventually stopped since I had other things to do and it took more and more time as the days went on.

• [2022 Day 8] Anyone have a solution that doesnt have a separate function for every direction?
  2 projects | /r/adventofcode | 17 Dec 2022
• -🎄- 2022 Day 5 Solutions -🎄-
  263 projects | /r/adventofcode | 4 Dec 2022

  Python 3 116/125

• -🎄- 2021 Day 24 Solutions -🎄-
  60 projects | /r/adventofcode | 23 Dec 2021

  Wow, my final solution looks almost exactly the same. Though I calculated my initial answers by hand.

• [2021 Day 18] When you check the leaderboard first and see most people taking 30+ minutes
  3 projects | /r/adventofcode | 18 Dec 2021

  That's certainly not necessary though and really not what makes most of the speed, especially for problems like today's. I don't really look at other leaderboard competitor's solutions much but at least my solutions (ranked ~20 today) are almost always completely vanilla Python (the only exception is networkx for the occasional graph problem but even that isn't really that much of a speedup if you know the common graph algorithms) and always self-contained.

• -🎄- 2021 Day 18 Solutions -🎄-
  144 projects | /r/adventofcode | 17 Dec 2021

  Interesting approach. I guess mine could be considered a bit nicer, doing it recursively and returning the number to add to the left or right.

• [2021 Day 15 (Part B)] [Golang] Pretty Organic, If You Ask Me.
  1 project | /r/adventofcode | 15 Dec 2021

  My priority Q/heap Dijkstra in Python runs just fine. I don't remember and can't check rn if it was instant or took a second but it definitely wasn't longer than that.

• A note from our sponsor - SaaSHub
  www.saashub.com | 7 Oct 2024

  SaaSHub helps you find the best software and product alternatives Learn more →