advent-of-code
aoc2018
advent-of-code | aoc2018 | |
---|---|---|
12 | 9 | |
22 | 0 | |
- | - | |
8.7 | 0.0 | |
4 months ago | 10 months ago | |
Python | Jupyter Notebook | |
- | MIT License |
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
-
-❄️- 2023 Day 6 Solutions -❄️-
[LANGUAGE: Python]
- How many lines of code was your day 3 solution?
-
-🎄- 2022 Day 17 Solutions -🎄-
Python, Part 1 Only
-
-🎄- 2022 Day 5 Solutions -🎄-
Python
-
-🎄- 2021 Day 3 Solutions -🎄-
Rust Version
-
-🎄- 2021 Day 2 Solutions -🎄-
Rust
-
[2018 day 9] [C] Fast solution to the marble game
When I get back home after the holiday weekend I'll try benchmarking on my machine properly. But here's my version (in Common Lisp): https://github.com/rabuf/advent-of-code/blob/master/2018/2018.09.org
-
Ada and Advent of Code 2021
Rest of 2021
-
Programing midlife "crysis"
I'm partial to Common Lisp, but both Scheme and Racket would be good choices as well. There's a few of us who've been using CL the last few years to solve (nearly) every puzzle. If you want to see (not always great) solutions to the puzzles in Common Lisp, here's my repo, of course don't look at days you haven't solved yet unless you want spoilers. But it can give you a feel for how CL can be used to solve the problems. I'd intended to revisit them and clean them up, but never got around to it.
-
[2020 Day 10 (Part 2)][C++] Non-memoization solution!
Interestingly, I think that solution is rather near the memoized version in one key regard. It's not memoization, however it's still storing all the results (the count for every joltage adaptor). You can massively reduce its storage by going with something like my solution (C-f for "part 2", there are two solutions one in Common Lisp and one in Ada), which is like the non-memoized iterative fibonacci series (psuedocode, pythonesque):
aoc2018
-
Working on integers consume more memory?
Here's an example where switching to int8/int16 sped up my program 3x, but insignificantly compared to development and compile times, namely from 15 to 5 ms. I haven't profiled it but I suspect it's because of the reduced memmove amounts in my improvised bsearch-sorted-array-insertion. Made this yesterday, solution to Advent of Code 2018 day 20: https://github.com/ednl/aoc2018/blob/main/20.c
-
[All years, all days][C#.NET] Joined the 400 stars club!
I made this jupyter notebook for a better idea and to directly compare different grid serial numbers. I think the condition "stop when no new max has been found twice in a row" will work most of the time. I tested a few other serial numbers and it seemed OK: the condition is only true directly AFTER the absolute maximum. But yes, there could well be other serial numbers where there is a dip of length 2 BEFORE the absolute maximum. Screenshot of the graph from the notebook: https://i.imgur.com/VXXpZnh.png
-
Advent of Code (AoC) Day One
This is the seventh year puzzles, if you want to check out previous years take a look at: 2015, 2016, 2017, 2018, 2019, 2020
-
[2018 day 9] [C] Fast solution to the marble game
Well, I think I mostly got it. But what I couldn't figure out was which updates to skip, so maybe it can get a bit faster still. Time on the M1 Mac Mini was 4.3 ms for combined user+system, see below. That system time being as long as the user time is maybe from the massive heap allocation and init to zero at program start? I also tried to do it dynamically with malloc, without block initialisation, but that was a tiny bit slower, so I left it as a static array. Pi 400: 98 ms, old Macbook from 2013: 36 ms (both same deal: user time = system time). Code: https://github.com/ednl/aoc2018/blob/main/day09alt.c
-
[2018 Day 16 (Part 2)] Interpretation of 2018, day 16, part 2
This is my solution in C which runs in under 2 ms: https://github.com/ednl/aoc2018/blob/main/day16.c
What are some alternatives?
Advent_Of_Code - My solution for the Advent of Code challenges in various languages.
aoc2017 - My solutions for Advent of Code 2017, each in a different language.
toit - Program your microcontrollers in a fast and robust high-level language.
advent-of-code - My Advent of Code submissions. For 2021 and before, these are the original code I used, without any modifications after-the-fact. As such, they are probably not as efficient or short as they should be, because I want a working solution faster, not a better solution. For 2022 and after, these are the solutions uploaded to my YouTube channel.
advent-of-code-cpp - C++ solutions for the Advent of Code programming puzzles - http://adventofcode.com/
advent-of-code - My C# .NET solutions to the ever popular Advent of Code
advent - Solving Advent of Code problems. See https://adventofcode.com/
Advent-of-Code - Advent of Code solutions
programming-challenges - My attempts at solving various programming challenges. Leetcode, codewars, adventofcode, etc
advent-of-code-2020 - Solutions of Advent of Code 2020
aoc2022 - Advent of Code 2022
advent-of-code - Advent of Code