Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 5, 2026 01:19olliecrowolliecrowError
Source Code

Source code access is restricted. Log in to request access.

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:17Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:19059,279,49638,294,0001,022,0002,113,536expected "74600294196621100 ", got "46980550909528876 "
2Jul 7, 2026 05:19052,303,32838,226,0002,042,0002,113,536expected "74600294196621100 ", got "47057839666953004 "
3Jul 7, 2026 05:19054,747,55138,456,0002,012,0002,113,536expected "74600294196621100 ", got "47749345798146348 "
4Mar 5, 2026 01:195,26567,657,54442,681,0001,016,0002,334,720
5Mar 5, 2026 01:195,40268,687,77442,844,0001,992,0002,342,912
6Mar 5, 2026 01:195,43172,784,48743,074,0002,003,0002,375,680
7Mar 5, 2026 01:195,64773,417,87342,878,0003,988,0002,314,240
8Mar 5, 2026 01:195,86878,627,45044,731,0003,976,0002,490,368
9Mar 5, 2026 01:195,87777,695,04845,796,0002,986,0002,330,624