Our great sponsors
-
Interestingly my Day 3 solution runs about 2x faster than you report, though I did have to adjust most_least to account for an edge case that I punted previously:
-
My original, unoptimized JS solution runs 9999999 in about 440 seconds. I thought that I'd cut that down with some heavy optimization, but it still takes the exact same time. Some loose profiling shows that most of the time is actually spent waiting for memory accesses, not in the CPU. I guess that's due to all the BigInts.
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
Wish I could do like https://github.com/Voltara/advent2019-fast/blob/master/src/day03.cpp and only check perpendicular pairs for intersections, but this problem has significantly more elements, because some pairs of vents can be collinear (and generate many intersections), and there are diagonals to contend with.
-
AdventOfCode.Template
Advent of Code C# (.NET 8) template. Based on AoCHelper (https://github.com/eduherminio/AoCHelper)
I didn't really care about executing times, but using C# I ran into array size limits which made me switch to my approach. I'm using eduherminio/AdventOfCode solver framework which returns 0.5ms as a result, which I'm pretty sure is not correct tough. Adding a stopwatch to the executing method returns 3ms. Hope that helps.