11 ms·
This intrigued me, and I believe that I've found a solution that's slightly faster for this AoC problem. It's achieved by keeping a running tally/counter for th
by zegl 4y ago
This intrigued me, and I believe that I've found a solution that's slightly faster for this AoC problem. It's achieved by keeping a running tally/counter for the last 14 characters (benchmark in comments).
https://gist.github.com/zegl/1ce3064c8049fa1b99c1dd202d785886 https://gist.github.com/zegl/1ce3064c8049fa1b99c1dd202d78588...