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 listSep 8, 2026 08:47Victor MerckléVictor MerckléScore: 4,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 08:514,45745,506,55930,531,0006,465,00024,576stderr
2Sep 8, 2026 08:514,52746,696,62930,642,0006,940,0002,117,632stderr
3Sep 8, 2026 08:514,54646,857,62531,290,0006,449,00024,576stderr
4Sep 8, 2026 08:514,60447,132,53230,542,0007,675,00024,576stderr
5Sep 8, 2026 08:514,64347,702,80931,027,0007,516,0002,117,632stderr
6Sep 8, 2026 08:514,66447,222,90331,063,0007,653,0002,117,632stderr
7Sep 8, 2026 08:514,67548,717,93331,254,0007,555,0002,117,632stderr
8Sep 8, 2026 08:514,75747,998,91431,380,0008,104,0002,117,632stderr
9Sep 8, 2026 08:515,09350,736,53931,796,00010,476,0002,117,632stderr