I had some trouble with the logic of this puzzle in my head, and the visuals were too large to realistically render for me to spot-check my solution, so I kept getting part 2 wrong. I eventually realized what needed to be done to get the right answer, which was partially the realization that I needed to check +99 instead of +100, and partially that I probably didn't need to check the entire space, just the bounding points (although I'm not entirely certain this is fully correct - I feel like I've seen some rows where a row below is shorter than a row above, which won't work with my solution here).
And then I optimized it with a bisect instead of a linear search. I think the bounds could be narrowed down, but I don't actually know what the min/max values are for all programs, and this is fast enough, so I'm leaving it alone. I'm not even sure that 2500 is a reasonable "too large" high end, honestly.
Parnic
03459bf31a
