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 19, 2026 13:29Victor MerckléVictor MerckléScore: 5,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 13:305,88058,224,97247,785,0001,020,0002,113,536
2May 19, 2026 13:305,88157,992,65547,795,0001,025,0002,113,536
3May 19, 2026 13:305,88259,456,24047,808,0001,017,0002,113,536
4May 19, 2026 13:305,88356,640,32347,815,0001,020,0002,113,536
5May 19, 2026 13:305,88859,048,57947,835,0001,036,0002,113,536
6May 19, 2026 13:305,90858,407,66248,014,0001,029,0002,113,536
7May 19, 2026 13:305,90858,939,81548,023,0001,015,0002,113,536
8May 19, 2026 13:305,92158,687,42948,113,0001,032,0002,113,536
9May 19, 2026 13:306,08358,251,24949,467,0001,022,0002,113,536