aoc2018
AdventOfCode2019
aoc2018 | AdventOfCode2019 | |
---|---|---|
9 | 10 | |
0 | 9 | |
- | - | |
0.0 | 2.6 | |
11 months ago | 5 months ago | |
Jupyter Notebook | Rust | |
MIT License | 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
AdventOfCode2019
-
Apple hiring compiler developers for improving Swift / C++ interoperability
The field is called "compiler design". Consider taking a course [1] or buying a book?
A somewhat more playful approach might be to complete the 2019 edition of Advent of Code [2], where you'll learn some preliminaries while implementing the Intcode interpreter.
[1] https://online.stanford.edu/courses/soe-ycscs1-compilers
[2] https://adventofcode.com/2019
- [All years, all dates] Me after finishing all Advent of Code problems this year (my first year of AoC)
- Prawda o Pracy
-
What's been your most favorite/fun project you've worked on?
The ending of Advent of Code 2019 was amazing. Well, the whole season was awesome, but the ending was amazing.
-
[2021 Day 1-25][Rust] Solutions to all of this year's problems in terse and clean Rust
2019 in Rust
-
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
-
QEMU Internals
I believe this is the direct link to the mentioned challenges: https://adventofcode.com/2019
-
I would to like to make a MAME frontend in Go.
If you want to get started, I would recommend doing Advent of Code 2019 https://adventofcode.com/2019. It goes through and shows how to implement a basic VM. 0x10c / DCPU-16 is also a good place to start. Such simplified CPU-s help you get started and understand the basics without overwhelming you with the complexity :D.
-
Advent of Code 2020 - Final Day: 25
Overall, I think this year felt a lot easier than the last one. Almost no graph problems, no path finding algorithms, and no insane math problems like day 22, 2019. It's really hard finding the right balance. I think 2019 was maybe a bit too hard and discouraged a lot of people. I like that this year was more approachable but perhaps it was a bit too easy towards the end.
-
-🎄- 2020 Day 25 Solutions -🎄-
Thanks for an amazing year! Definitely a lot easier this year than last one, which was a bit sad. No hard graph problems, requiring path finding algorithms, no insane math problems like day 22 last year. It's hard finding the right balance. I think 2019 was maybe a bit too hard and this year maybe too easy.
What are some alternatives?
aoc2017 - My solutions for Advent of Code 2017, each in a different 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.
aoc2016 - My solutions for Advent of Code 2016, each in a different language
advent-of-code - My C# .NET solutions to the ever popular Advent of Code
fynegameboy - 🕹️ A basic gameboy emulator for desktop and mobile
Advent-of-Code - Advent of Code solutions
GoBoy - Multi-platform Nintendo Game Boy Color emulator written in Go
AdventOfCode2021 - Solutions to all 25 AoC 2021 problems in Rust :crab: Less than 100 lines per day and under 1 second total execution time! :christmas_tree:
AdventOfCode2020 - Solutions to all 25 AoC 2020 problems in Rust :christmas_tree:
aoc2020 - Advent of Code 2020 - my answers
dcpu-specifications - Specifications for the fictional hardware of the game 0x10c