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 09:27Victor MerckléVictor MerckléScore: 6,106Success
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 09:326,09460,548,61049,576,0001,008,0002,113,536
2May 19, 2026 09:326,10460,204,69349,647,0001,024,0002,113,536
3May 19, 2026 09:326,10561,623,65749,666,0001,007,0002,113,536
4May 19, 2026 09:326,10658,500,05049,676,0001,011,0002,113,536
5May 19, 2026 09:326,10660,061,30449,661,0001,024,0002,113,536
6May 19, 2026 09:326,11958,598,74849,765,0001,029,0002,113,536
7May 19, 2026 09:326,19462,182,98350,388,0001,027,0002,113,536
8May 19, 2026 09:326,25159,690,68250,850,0001,034,0002,113,536
9May 19, 2026 09:326,26061,293,13250,953,0001,005,0002,113,536