[2021 Day 18] When you check the leaderboard first and see most people taking 30+ minutes

• AdventOfCode

  18 58 7.5 Python

  My solutions for all years of Advent of Code in Python 3 and Rust (by benediktwerner)

That's certainly not necessary though and really not what makes most of the speed, especially for problems like today's. I don't really look at other leaderboard competitor's solutions much but at least my solutions (ranked ~20 today) are almost always completely vanilla Python (the only exception is networkx for the occasional graph problem but even that isn't really that much of a speedup if you know the common graph algorithms) and always self-contained.

• AdventOfCode

  26 324 8.0 Python

  My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA

And e.g. Jonathan Paulson never uses any libraries and always starts basically from scratch.

• InfluxDB

  www.influxdata.com featured

  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.

  

• AdventOfCode2021

  3 0 0.0 Python

Re it turning into an infinite loop: Are you sure it was the reduction? Because I ran into the problem of recursing too deep in the explosion/splitting step when I tried disabling intermediate reductions. But it should not result in any nonbinary trees as intermediaries since all operations should retain this "binarity" which we start with. Which input made these problems for you? Then I can check my intermediaries for it (or you can check it via my code here https://github.com/SV-97/AdventOfCode2021/blob/main/Day_18_2/main.py)

Suggest a related project