AOC2023
Advent of Code 2023 (by wlmb)
advent-of-code
Advent of Code (by MichaelBrunn3r)
AOC2023 | advent-of-code | |
---|---|---|
8 | 7 | |
0 | 1 | |
- | - | |
8.2 | 9.5 | |
4 months ago | 4 months ago | |
Perl | Rust | |
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.
AOC2023
Posts with mentions or reviews of AOC2023.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-09.
advent-of-code
Posts with mentions or reviews of advent-of-code.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-07.
-
-❄️- 2023 Day 8 Solutions -❄️-
[LANGUAGE: Rust]I was running in circles trying to solve this one.First part was easy enough. I was running into an infinite loop in part 2 and then sadly was spoilered the LCM solution. At least I head fun optimizing the code :)Part 2: I converted the 3 char node names into u16 keys. I store the keys of the left/right successors of each node in a massive array, which I can simply index with they node keys. This proved significantly faster than a HashMap. While converting lines into nodes, I store all keys of nodes ending in an A in a starting nodes array. Next, I calcualte the cycle length for each starting row and then calculating the common LCM. I used rayon to speed things up with multithreading (minor improvement)[Code]
-
-❄️- 2023 Day 7 Solutions -❄️-
38.659 µs / 41.981 µs after removing some allocations and custom input parsing [Code].
- -❄️- 2023 Day 6 Solutions -❄️-
- -❄️- 2023 Day 5 Solutions -❄️-
- -❄️- 2023 Day 4 Solutions -❄️-
What are some alternatives?
When comparing AOC2023 and advent-of-code you can also consider the following projects:
aoc2023 - Advent of Code 2023 (Mojo)
adventofcode2023 - https://adventofcode.com
Advent-of-Code-2023
advent-of-code
AdventOfCode2023
advent-of-code - Solutions to Advent of Code (https://adventofcode.com/)
AdventOfCode2023 - AdventOfCode2023
advent-of-code-2023
advent-of-code - :santa: :christmas_tree: :snowman: http://adventofcode.com/ solutions
advent-of-code-2023
aoc2023 - Advent of code 2023 solutions
adventOfCode
AOC2023 vs aoc2023
advent-of-code vs adventofcode2023
AOC2023 vs Advent-of-Code-2023
advent-of-code vs advent-of-code
AOC2023 vs AdventOfCode2023
advent-of-code vs advent-of-code
AOC2023 vs AdventOfCode2023
advent-of-code vs advent-of-code-2023
AOC2023 vs advent-of-code
advent-of-code vs advent-of-code-2023
AOC2023 vs aoc2023
advent-of-code vs adventOfCode