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 11, 2026 20:42Victor MerckléVictor MerckléScore: 10,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 20:4610,06493,389,44682,395,0001,138,0002,117,632stderr
2Sep 11, 2026 20:4610,09394,162,05382,648,0001,127,0002,117,632stderr
3Sep 11, 2026 20:4610,09494,307,30582,761,0001,024,0002,117,632stderr
4Sep 11, 2026 20:4610,10393,664,42482,704,0001,158,0002,117,632stderr
5Sep 11, 2026 20:4610,11193,743,43882,776,0001,153,0002,117,632stderr
6Sep 11, 2026 20:4610,13394,641,79683,079,0001,025,0002,117,632stderr
7Sep 11, 2026 20:4610,14894,743,39883,215,0001,020,0002,117,632stderr
8Sep 11, 2026 20:4610,16294,725,84783,197,0001,148,0002,117,632stderr
9Sep 11, 2026 20:4610,16795,784,07883,376,0001,011,0002,117,632stderr