aoc2021
Advent of Code 2021 (by UnicycleBloke)
aoc2021
Advent of Code 2021 - my answers (by ephemient)
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.
aoc2021
Posts with mentions or reviews of aoc2021.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-09-14.
-
I'm learning c++ at work the last few months, and I'm considering asking to do AoC during work - what prep could I do for AoC in c++?
The fiddliest part is processing the input into usable form. I ended up with a template which used regex to convert a file of similar lines into a vector of tuples. It's not amazing code, I'm sure, but it did the job: https://github.com/UnicycleBloke/aoc2021/blob/master/utils/utils.h, used for example here in the run() function: https://github.com/UnicycleBloke/aoc2021/blob/master/day13/day13.cpp. Share and enjoy. ;)
-
[DAY 6] C# solution with commentary
I'm not certain, but this seems similar to my solution: https://github.com/UnicycleBloke/aoc2021/blob/master/day06/day06.cpp. I rotate an array of counts for days, and add the count for Day 8 to that for Day 6. Speed depends on the machine, but both parts run in about a millisecond on mine.
-
Anyone using c++'s standard libraries for AOC?
My code isn't amazing or anything, but it is here: https://github.com/UnicycleBloke/aoc2021
- -🎄- 2021 Day 14 Solutions -🎄-
-
-🎄- 2021 Day 5 Solutions -🎄-
C++: https://github.com/UnicycleBloke/aoc2021/blob/master/day05/day05.cpp
- -🎄- 2021 Day 4 Solutions -🎄-
-
-🎄- 2021 Day 3 Solutions -🎄-
C++ https://github.com/UnicycleBloke/aoc2021/blob/master/day03/day03.cpp. I suspect I'm overdoing the template-y goodness, but it's a learning exercise. Made such a meal of Part 2...
-
-🎄- 2021 Day 2 Solutions -🎄-
Nice. I figured we'll be parsing lines a lot so have written a function to parse the input into a vector of tuples: https://github.com/UnicycleBloke/aoc2021/blob/master/day02/day02.cpp.
aoc2021
Posts with mentions or reviews of aoc2021.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-02-04.
-
All years, all days, everything in Haskell
I've done every year in Haskell (2015 2016 2017 2018 2019 2020 2021), and so have several other people such as /u/glguy. I don't see if /u/mstksg has anything published for 2015 but they've done 2016 2017 2018 2019 2020 2021 along with some pretty good writeups, I recommend checking those out.
-
Jetbrains looks like it's about to release Compose ui for ios, and web!
I ran my own benchmarks for a whole ton of code at https://github.com/ephemient/aoc2021 on both Linux x64 and macos x64, and ended up disabling Kotlin/Native because it was varying between 10x and 100x slower than Kotlin/JVM, eventually timing out on CI. The generated code may be reasonable thanks to LLVM, but the runtime certainly is not.
-
-🎄- 2021 Day 25 Solutions -🎄-
Took a while for me to get around to completing this in Kotlin, Python, and Rust as well, since I was working on optimizing other solutions, but I finally made it.
-
-🎄- 2021 Day 24 Solutions -🎄-
So I switched tacks and implemented this in Kotlin, where mutation is easier. First version was brute-force with duplicate state avoidance (checked before the state explosion at every input), which worked quickly enough for part 1, but ran into OOMs for part 2. Once I replaced the HashSet with a custom LruSet (and later a simpler CacheSet which simply overwrites on hash collisions) it ran part 2 in a few minutes. I then ported this into Haskell.
-
-🎄- 2021 Day 23 Solutions -🎄-
Haskell 1171/339
-
-🎄- 2021 Day 22 Solutions -🎄-
Kotlin, Python, and Rust solutions are the same solution but much uglier.
-
-🎄- 2021 Day 21 Solutions -🎄-
I'm doing the same cached recursion in Kotlin, Python, and Rust.
-
-🎄- 2021 Day 20 Solutions -🎄-
Haskell 621/603
-
-🎄- 2021 Day 19 Solutions -🎄-
Haskell 258/240
-
-🎄- 2021 Day 18 Solutions -🎄-
Haskell Kotlin 622/1185
What are some alternatives?
When comparing aoc2021 and aoc2021 you can also consider the following projects:
adventofcode - Advent of code solutions
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
advent-of-code
AoC - my personal repo for the advent of code yearly challenge
AdventOfCode2021.jl - Advent of Code 2021 in Julia
adventofcode - Advent of Code challenge solutions
adventofcode - Solutions for problems from AdventOfCode.com
roast - 🦋 Raku test suite
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
advent-of-code
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022