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.
aoc2022
Posts with mentions or reviews of aoc2022.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-04-06.
-
2015-2022: What solution to a problem are you the most proud of
Then go check out this solution: https://github.com/fizbin/aoc2022/blob/main/aoc18b.py
aoc2020
Posts with mentions or reviews of aoc2020.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-07-06.
-
Need help finding good python solutions
I got all but one star in 2020 when I did it in Python: https://github.com/ednl/aoc2020 but I'm afraid there may be some short variable names despite not doing it for speed.
-
2015-2022: What solution to a problem are you the most proud of
I liked my solution for https://adventofcode.com/2020/day/17 Game of Life in 3D and 4D: https://github.com/ednl/aoc2020/blob/main/day17.py
-
2020 Day 8.2 in Python - trying to figure out how to do this efficiently?
Day 8 runs in 0.02 s using python 3.9 on my M1 Mac Mini. Just flipping in part 2, no special optimisation. My code: https://github.com/ednl/aoc2020/blob/main/day08.py
-
[2020] [Rust] Solving Advent of Code 2020 in under a second
Yep, linked above, or: https://github.com/ednl/aoc2020/blob/main/day15.c
- [2020 Day 17] Breaking Day 17's Game of Life to extreme levels, with interactive visualizations and demos
-
[2020 Day 6 (Part 2)][C] Works on example but not on puzzle input. Can't figure out why.
Good that you got it working! My version in C is a bit shorter, perhaps you could use some ideas for the next puzzles? I like the dynamically sized getline() function, for instance: https://github.com/ednl/aoc2020/blob/main/day06.c
-
Day 3 AoC
Here is my C version with lots of built-in checks: https://github.com/ednl/aoc2020/blob/main/day03.c
-
[2020] Optimized solutions in C++ (291 ms total)
Day 23 part 2 in 0.06 s on a dual core 1.3 GHz i5 Haswell (2013 MB Air) https://github.com/ednl/aoc2020/blob/main/day23.c because of a simple array as a linked list.
-
[2020 Day *][C99] Computers are fast: AoC 2020 in < 2s, including compile time
Day 23 part 2 (1 million cups, 10 million moves) runs in 0.06 s on my 2013 dual core Haswell i5 1.3 GHz. Main reason is a super fast simulated linked list via a pre-allocated array of integers. Source https://github.com/ednl/aoc2020/blob/main/day23.c
-
-🎄- 2020 Day 24 Solutions -🎄-
Thanks to /u/thomasahle for encouraging me to implement axial coordinates, which made it a lot easier. Also thought of a better way to parse the input in one go. And this allowed me to tighten up the grid dimensions. Runs in under a second on a very old laptop, half of which is because of the scipy import ... https://github.com/ednl/aoc2020/blob/main/day24alt2.py