SaaSHub helps you find the best software and product alternatives Learn more →
Adventofcode Alternatives
Similar projects and alternatives to adventofcode
-
-
InfluxDB
InfluxDB – Built for High-Performance Time Series Workloads. InfluxDB 3 OSS is now GA. Transform, enrich, and act on time series data directly in the database. Automate critical tasks and eliminate the need to move data externally. Download now.
-
-
-
-
advent-of-code
Discontinued My Advent of Code answers [GET https://api.github.com/repos/tcsullivan/advent-of-code: 404 - Not Found // See: https://docs.github.com/rest/repos/repos#get-a-repository] (by tcsullivan)
-
Sevalla
Deploy and host your apps and databases, now with $50 credit! Sevalla is the PaaS you have been looking for! Advanced deployment pipelines, usage-based pricing, preview apps, templates, human support by developers, and much more!
-
-
-
-
-
-
-
-
-
-
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
adventofcode discussion
adventofcode reviews and mentions
-
An O(n) algorithm for day 11
https://github.com/ednl/adventofcode/blob/main/2023/11.c https://github.com/ednl/adventofcode/blob/main/2023/11alt.c
- -❄️- 2023 Day 11 Solutions -❄️-
-
[2023 Day 8 (Part 2)][GLSL] Brute forced in under a minute on a GPU
First estimate of the lower bound on a single-threaded CPU solution with a ten year old computer is about 10 hours, or 26 hours on a Raspberry Pi 4, ha ha. github
-
-❄️- 2023 Day 8 Solutions -❄️-
Aww, Eric was too kind to us and made sure that we didn't have to detect loops! With some nifty optimisations, my whole program runs in 2.5 ms on a Raspberry Pi 4. Code with lots of comments: https://github.com/ednl/adventofcode/blob/main/2023/08.c My walk function:
-
-❄️- 2023 Day 7 Solutions -❄️-
Complete code with lots of comments: https://github.com/ednl/adventofcode/blob/main/2023/07.c
-
-❄️- 2023 Day 6 Solutions -❄️-
I solved the quadratic equation and that makes the whole program run in 1.2 ms on a Raspberry Pi 4. But simply trying every possible button time isn't much slower: also took milliseconds, shrug. Here is my very verbose function to solve per race. The sq < 0 test was not necessary for the example or my input. Complete code: https://github.com/ednl/adventofcode/blob/main/2023/06.c
-
-❄️- 2023 Day 4 Solutions -❄️-
C has no intersection operation, so I sorted the numbers and counted the matches "manually". Only kept an array for the number of card copies and could do the rest while reading the input. Runs in 3.2 ms on an old 2013 iMac, 3.9 ms on a Raspberry Pi 4 (cpu governor = performance). Short code, only one separate function for sorting: https://github.com/ednl/adventofcode/blob/main/2023/04.c
-
A note from our sponsor - SaaSHub
www.saashub.com | 31 Aug 2025
Stats
ednl/adventofcode is an open source project licensed under MIT License which is an OSI approved license.
The primary programming language of adventofcode is C.