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 11, 2026 14:07Victor MerckléVictor MerckléScore: 10,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 14:0710,33697,228,38984,537,0001,259,0002,113,536
2May 11, 2026 14:0710,33796,428,92884,792,0001,010,0002,113,536
3May 11, 2026 14:0710,33895,555,28984,535,0001,278,0002,113,536
4May 11, 2026 14:0710,33996,991,43784,554,0001,264,0002,113,536
5May 11, 2026 14:0710,34296,919,11984,831,0001,010,0002,113,536
6May 11, 2026 14:0710,34397,340,21784,562,0001,286,0002,113,536
7May 11, 2026 14:0710,35196,703,32984,905,0001,010,0002,113,536
8May 11, 2026 14:0710,35396,142,95884,921,0001,011,0002,113,536
9May 11, 2026 14:0710,35897,019,32284,722,0001,254,0002,113,536