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 21, 2026 09:02Victor MerckléVictor MerckléScore: 4,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 09:034,76147,528,82338,465,0001,055,0002,113,536
2May 21, 2026 09:034,76349,436,52338,473,0001,068,0002,113,536
3May 21, 2026 09:034,78550,600,38738,696,0001,020,0002,113,536
4May 21, 2026 09:034,78747,686,05138,738,0001,002,0002,113,536
5May 21, 2026 09:034,79447,579,40438,771,0001,025,0002,113,536
6May 21, 2026 09:034,79549,421,74838,770,0001,035,0002,113,536
7May 21, 2026 09:034,79847,826,49538,760,0001,067,0002,113,536
8May 21, 2026 09:034,82649,239,20739,054,0001,003,0002,113,536
9May 21, 2026 09:034,89948,521,70339,635,0001,034,0002,113,536