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
- -🎄- 2021 Day 17 Solutions -🎄-
- -🎄- 2021 Day 16 Solutions -🎄-
- -🎄- 2021 Day 15 Solutions -🎄-
- -🎄- 2021 Day 13 Solutions -🎄-
- -🎄- 2021 Day 12 Solutions -🎄-
- -🎄- 2021 Day 11 Solutions -🎄-
- -🎄- 2021 Day 10 Solutions -🎄-
- [2021 Day 9] Part 1 - 48 min to get it to work. I should go back to Python for these
- -🎄- 2021 Day 9 Solutions -🎄-
- -🎄- 2021 Day 8 Solutions -🎄-
aoc2021
-
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?
adventofcode - Advent of code
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
advent-of-code-2021 - 🎄 My Advent of Code solutions in Rust. http://adventofcode.com/2021
AoC - my personal repo for the advent of code yearly challenge
aoc2021 - Advent of Code 2021, in Rust
adventofcode - Advent of Code challenge solutions
advent-of-code-2021 - Solutions for the Advent of Code 2021 puzzles
roast - 🦋 Raku test suite
advent-of-code-2021 - My solutions to advent of code 2021 in deno/TS
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
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