aoc2018

Advent of Code 2018 (by ednl)

Aoc2018 Alternatives

Similar projects and alternatives to aoc2018

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better aoc2018 alternative or higher similarity.

aoc2018 reviews and mentions

Posts with mentions or reviews of aoc2018. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-05-05.
  • Working on integers consume more memory?
    1 project | /r/C_Programming | 28 Jun 2023
    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!
    6 projects | /r/adventofcode | 5 May 2023
    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
    6 projects | dev.to | 1 Dec 2021
    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
    4 projects | /r/adventofcode | 27 Nov 2021
    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
    1 project | /r/adventofcode | 16 Oct 2021
    This is my solution in C which runs in under 2 ms: https://github.com/ednl/aoc2018/blob/main/day16.c
  • A note from our sponsor - SaaSHub
    www.saashub.com | 18 Apr 2024
    SaaSHub helps you find the best software and product alternatives Learn more →

Stats

Basic aoc2018 repo stats
9
0
0.0
10 months ago

ednl/aoc2018 is an open source project licensed under MIT License which is an OSI approved license.

The primary programming language of aoc2018 is Jupyter Notebook.

SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com