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 12:22Victor MerckléVictor MerckléScore: 4,674Success
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 12:234,65347,038,64837,544,0001,079,0002,113,536
2May 21, 2026 12:234,66046,533,54737,654,0001,029,0002,113,536
3May 21, 2026 12:234,66946,424,82537,710,0001,045,0002,113,536
4May 21, 2026 12:234,67448,338,09837,732,0001,067,0002,113,536
5May 21, 2026 12:234,67446,794,06137,767,0001,033,0002,113,536
6May 21, 2026 12:234,68046,829,48737,789,0001,058,0002,113,536
7May 21, 2026 12:234,68246,753,92937,787,0001,078,0002,113,536
8May 21, 2026 12:234,70246,912,75938,023,0001,006,0002,113,536
9May 21, 2026 12:234,70348,220,66638,013,0001,023,0002,113,536