advent-of-rust
Solutions to the Advent of Code challenges in Rust! (by sciyoshi)
AOC2022
Advent of Code 2022, solved in Haskell (by MatthiasCoppens)
advent-of-rust | AOC2022 | |
---|---|---|
2 | 9 | |
31 | 0 | |
- | - | |
8.7 | 10.0 | |
5 months ago | over 1 year ago | |
Rust | Haskell | |
MIT License | - |
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-rust
Posts with mentions or reviews of advent-of-rust.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-22.
-
-🎄- 2022 Day 23 Solutions -🎄-
Rust solution [326/300]
-
-🎄- 2022 Day 13 Solutions -🎄-
Rust solution (178/172)
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 2022-12-22.
-
-🎄- 2022 Day 23 Solutions -🎄-
Haskell, pretty slow at 9 s.
-
-🎄- 2022 Day 15 Solutions -🎄-
Haskell, by far my slowest solution at 6 s.
-
-🎄- 2022 Day 13 Solutions -🎄-
Haskell, 8 ms.
-
-🎄- 2022 Day 12 Solutions -🎄-
Haskell, 40 ms. I represented the grid as a map (type Grid = M.Map Coord Height) and made the height an Enum instance (data Height = Start | Height Char | End). I think I used Dijkstra?
-
-🎄- 2022 Day 6 Solutions -🎄-
Haskell, 15 ms. Probably my shortest AoC solution ever.
-
-🎄- 2022 Day 5 Solutions -🎄-
Haskell, runs in 10 ms.
-
-🎄- 2022 Day 4 Solutions -🎄-
Haskell, runs in 15 ms. First day this year it made sense to make a monadic parser. I really like to use Text.ParserCombinators.ReadP!
-
-🎄- 2022 Day 3 Solutions -🎄-
Haskell, runs in 4 ms. I feel a little dirty using S.findMin and M.!, but it surely does work pretty good when the input is clean.
-
-🎄- 2022 Day 2 Solutions -🎄-
Haskell, runs in 3 ms. I had some fun with Ord and Enum, there really should be some modular Enum.
What are some alternatives?
When comparing advent-of-rust and AOC2022 you can also consider the following projects:
advent - advent of code
aoc2022 - My Advent of Code 2022 solutions!
aoc2022
aoc2022 - Advent of Code 2022
a2tools - Stuff I write for my Apple //c
aoc - Advent of Code
AdventOfCode - Hacky solutions for [Advent of Code](https://adventofcode.com), working on past problems
aoc-go - A Golang tool for generating code for Advent of Code
adventOfCode - Advent of code solutions, probably mostly in C++, but maybe in Rust in the (near) future.
AoC2022 - Solutions to Advent of Code 2022 puzzles.
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022