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 13, 2026 14:30Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 14:31072,834,70664,405,0001,022,0002,113,536expected "53690948950271443 ", got "53690925910271443 "
2May 13, 2026 14:31073,534,25964,404,0001,017,0002,113,536expected "53686867096423975 ", got "53686844056423975 "
3May 13, 2026 14:31074,927,12664,395,0001,038,0002,113,536expected "53688422765810996 ", got "53688399725810996 "
4May 13, 2026 14:317,87272,749,46964,339,0001,005,0002,113,536
5May 13, 2026 14:317,87775,145,10364,376,0001,011,0002,113,536
6May 13, 2026 14:317,88474,698,32864,421,0001,023,0002,113,536
7May 13, 2026 14:317,88875,561,91164,452,0001,019,0002,113,536
8May 13, 2026 14:317,89074,952,92964,477,0001,017,0002,113,536
9May 13, 2026 14:317,90673,531,73164,478,0001,142,0002,113,536