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 listMay 14, 2026 14:35Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 14:36040,774,90432,502,0001,036,0002,113,536expected "53684105789878398 ", got "53684105772328231 "
2May 14, 2026 14:364,01542,509,60632,330,0001,001,0002,113,536
3May 14, 2026 14:364,01541,773,74332,311,0001,017,0002,113,536
4May 14, 2026 14:364,02040,733,36132,294,0001,075,0002,113,536
5May 14, 2026 14:364,02242,181,50232,363,0001,025,0002,113,536
6May 14, 2026 14:364,02642,293,07932,383,0001,041,0002,113,536
7May 14, 2026 14:364,03141,466,48732,365,0001,099,0002,113,536
8May 14, 2026 14:364,03240,795,35032,452,0001,016,0002,113,536
9May 14, 2026 14:364,04542,894,48332,568,0001,011,0002,113,536