advent-of-code-2021
ð My Advent of Code solutions in Rust. http://adventofcode.com/2021 (by timvisee)
aoc2021
Advent of Code 2021 - my answers (by ephemient)
Our great sponsors
advent-of-code-2021 | aoc2021 | |
---|---|---|
14 | 32 | |
240 | 26 | |
- | - | |
2.6 | 0.0 | |
5 months ago | about 1 year ago | |
Rust | Kotlin | |
GNU General Public License v3.0 only | - |
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.
advent-of-code-2021
Posts with mentions or reviews of advent-of-code-2021.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-03-03.
-
Demystifying bitwise operations, a gentle C tutorial
Some very interesting advent of code contributions written in Rust, available on github, use bitwise operations. Shout out to Tim Visee! https://github.com/timvisee/advent-of-code-2021/blob/master/...
-
Bugs that the Rust compiler catches for you
This may be the closest thing I've personally seen: https://github.com/timvisee/advent-of-code-2021
-
-ð- 2021 Day 16 Solutions -ð-
Part 2 0.022ms (22Ξs)
-
-ð- 2021 Day 15 Solutions -ð-
Part 1 1.05ms
- [2021 Day 12 Part 2] Has somebody found a sub 1s solution for part 2?
-
-ð- 2021 Day 12 Solutions -ð-
Part 1 0.861ms (861Ξs)
-
-ð- 2021 Day 11 Solutions -ð-
See https://github.com/timvisee/advent-of-code-2021/blob/master/runner/src/bin/bench.rs
- [2021 Day 9] Part 1 - 48 min to get it to work. I should go back to Python for these
-
-ð- 2021 Day 6 Solutions -ð-
Part 1 0.0027ms (2.7Ξs)
-
-ð- 2021 Day 5 Solutions -ð-
The orientation calculation could be done by matrix indexes operations https://github.com/FlakM/aoc2021/blob/main/day5/task1/src/main.rs and then its easier to create ranges. You can also use some clever crates and get some calculations for free https://github.com/timvisee/advent-of-code-2021/blob/master/day05b/src/main.rs
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 advent-of-code-2021 and aoc2021 you can also consider the following projects:
adventlang - ð A programming language (+ code playground) for Advent of Code.
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
Advent_of_Code - My Advent of Code solutions.
AoC - my personal repo for the advent of code yearly challenge
advents-of-code - ðð Solutions for the yearly advent of code challenges
adventofcode - Advent of Code challenge solutions
aoc2020 - Advent of Code 2020
roast - ðĶ Raku test suite
public
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
advent-of-code-rust - My solutions to 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
advent-of-code-2021 vs adventlang
aoc2021 vs adventofcode
advent-of-code-2021 vs Advent_of_Code
aoc2021 vs AoC
advent-of-code-2021 vs advents-of-code
aoc2021 vs adventofcode
advent-of-code-2021 vs aoc2020
aoc2021 vs roast
advent-of-code-2021 vs public
aoc2021 vs advent-2021
advent-of-code-2021 vs advent-of-code-rust
aoc2021 vs advent-of-code-go