aoc2018
Advent-of-Code
aoc2018 | Advent-of-Code | |
---|---|---|
9 | 3 | |
0 | 6 | |
- | - | |
0.0 | 8.5 | |
11 months ago | 3 days ago | |
Jupyter Notebook | C# | |
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.
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
Advent-of-Code
-
[All years, all days][C#.NET] Joined the 400 stars club!
My own (still growing) C# repo.
-
2015-2022: What solution to a problem are you the most proud of
All of my C# repos.
-
[2016 Day 5] Cinematic "decrypting" animation.
My Github repo if you'd like to see the mess of code to make that work.
What are some alternatives?
aoc2017 - My solutions for Advent of Code 2017, each in a different language.
aoc - Advent of Code Solutions - https://adventofcode.com/
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.
aoc2022 - Advent of code 2022
advent-of-code - My C# .NET solutions to the ever popular Advent of Code
AdventOfCode2017 - My solutions for AoC 2017, using Nim, OCaml, and Python
advent_of_code_2021 - Advent of Code 2021 solutions in PostScript (and little bit of Awk)
aoc2020 - Advent of Code 2020
adventofcode - Answers to Advent of Code