Our great sponsors
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.
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 2020-12-21.
-
-🎄- 2020 Day 22 Solutions -🎄-
Python (1906/2343): https://github.com/UnicycleBloke/aoc2020/blob/main/day22/day22.py
-
2020 Day 21 Solutions
Python. Nothing amazing: just fiddling with sets. Took me a while to work out which operations would get me what I needed. https://github.com/UnicycleBloke/aoc2020/blob/main/day21/day21.py
aoc-2020
Posts with mentions or reviews of aoc-2020.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2020-12-26.
-
Now what? (350 stars)
I've tried it a few times and solutions were surprisingly elegant! E.g., 2020-01-p2.
-
[2020] Optimized solutions in C++ (291 ms total)
Figured I'd post my benches as well, see below. Everything done in Rust (link to source).
-
-🎄- 2020 Day 24 Solutions -🎄-
Here's my day 24 in Rust, using SIMD as usual :) (and offset coordinate encoding to make a SIMD-friendly 2-D cell grid)
-
-🎄- 2020 Day 22 Solutions -🎄-
Borrowed both ideas in my version :) On my input your version runs at 3ms, mine in 1.5ms, so it might be faster on some inputs (link). I initially started with something similar to yours but then figured why not use 512-bit ints, so that the notion of 'head' and 'tail' disappears as your head then stays at position 0 (so, e.g., to remove a card, you just right-shift the whole bigint). Also used a tiny bit of simd along the way.
What are some alternatives?
When comparing aoc2020 and aoc-2020 you can also consider the following projects:
advent-of-code-2020 - 🎅🌟❄️☃️🎄🎁
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal
advent-of-code-2020-jq - Solving Advent of Code with jq [Moved to: https://github.com/odnoletkov/advent-of-code-jq]
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
advent-of-code
hac - HAC Ada Compiler - a small, quick Ada compiler fully in Ada
adventofcode.com
aoc-2020 - My solutions for https://adventofcode.com
AdventOfCode-Java - adventOfCode(Language.JAVA);
advent-of-code-2020 - Solutions for Advent of code
advent-of-code-2020 - Answers and solutions for Advent of Code 2020.
aoc2020 vs advent-of-code-2020
aoc-2020 vs Advent_of_Code_in_Pascal
aoc2020 vs advent-of-code-2020-jq
aoc-2020 vs advent-of-code-go
aoc2020 vs advent-of-code
aoc-2020 vs hac
aoc2020 vs adventofcode.com
aoc-2020 vs aoc-2020
aoc2020 vs Advent_of_Code_in_Pascal
aoc-2020 vs AdventOfCode-Java
aoc2020 vs advent-of-code-2020
aoc-2020 vs advent-of-code-2020