AdventOfCode
My solutions for all years of Advent of Code in Python 3 and Rust (by benediktwerner)
aoc
Advent of Code - mscha's Perl 6 solutions (by mscha)
Our great sponsors
AdventOfCode | aoc | |
---|---|---|
18 | 22 | |
58 | 1 | |
- | - | |
7.5 | 9.0 | |
9 days ago | 4 months ago | |
Python | Raku | |
Creative Commons Zero v1.0 Universal | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
AdventOfCode
Posts with mentions or reviews of AdventOfCode.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-07-06.
-
[2016 Day 14 (Part 2)][Python] Is there a trick to speed this up?
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
Here are mine: https://github.com/benediktwerner/AdventOfCode
- [2022 All Days]
-
Running time goals (more of a survey question)
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?
-
-🎄- 2022 Day 5 Solutions -🎄-
Python 3 116/125
-
-🎄- 2021 Day 24 Solutions -🎄-
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
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 -🎄-
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.
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.
aoc
Posts with mentions or reviews of aoc.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-09.
- -❄️- 2023 Day 10 Solutions -❄️-
-
-❄️- 2023 Day 9 Solutions -❄️-
Full code at GitHub.
-
-❄️- 2023 Day 7 Solutions -❄️-
Edit: you don't need to determine the type of hand, but you can directly compare the card counts. Second version @GitHub.
-
-🎄- 2022 Day 13 Solutions -🎄-
New version @GitHub.
-
-🎄- 2022 Day 12 Solutions -🎄-
So, a new version with a lot less almost-duplicate code @GitHub.
- -🎄- 2022 Day 2 Solutions -🎄-
-
-🎄- 2022 Day 1 Solutions -🎄-
@GitHub
-
-🎄- 2021 Day 21 Solutions -🎄-
Completed part 2, see GitHub. I couldn't really use the same `DiracDice` class and simply use another `Die`, but had to create a separate `DiracDice2` class.Basically, just keep track of the possible universe state and their counts, and try all possible combinations of die rolls. Keep playing until all universes have a winner.
-
-🎄- 2021 Day 20 Solutions -🎄-
The rest is the same as my first attempt, but full code at GitHub.
-
-🎄- 2021 Day 18 Solutions -🎄-
I spent way too much time on this, but I completed my original attempt with the proper object model, see GitHub
What are some alternatives?
When comparing AdventOfCode and aoc you can also consider the following projects:
advent-of-code-2020 - :christmas_tree: My Advent of Code solutions in Rust. http://adventofcode.com/2020
rockstar - The Rockstar programming language specification
advent_of_code_2021_v2
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
advent-of-code
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
adventofcode - Advent of Code challenge solutions
adventofcode - Advent of code solutions
AOC2021-in-Fortran - Advent of Code 2021 solutions in Fortran
advent-of-code-2021 - zig solutions to advent of code 2021
adventofcode - :christmas_tree: Advent of Code (2015-2023) in C#
Advent-of-Code - Advent of Code
AdventOfCode vs advent-of-code-2020
aoc vs rockstar
AdventOfCode vs advent_of_code_2021_v2
aoc vs advent-2021
AdventOfCode vs advent-of-code
aoc vs AdventOfCode
AdventOfCode vs adventofcode
aoc vs adventofcode
AdventOfCode vs AOC2021-in-Fortran
aoc vs advent-of-code-2021
AdventOfCode vs adventofcode
aoc vs Advent-of-Code