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:54Victor MerckléVictor MerckléScore: 10,077Success
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:5710,02893,015,58582,232,0001,008,0002,117,632stderr
2Sep 11, 2026 20:5710,03193,052,65682,128,0001,135,0002,117,632stderr
3Sep 11, 2026 20:5710,04093,225,54282,192,0001,140,0002,117,632stderr
4Sep 11, 2026 20:5710,04893,213,42782,274,0001,129,0002,117,632stderr
5Sep 11, 2026 20:5710,07793,446,58382,517,0001,130,0002,117,632stderr
6Sep 11, 2026 20:5710,08094,009,50682,517,0001,155,0002,117,632stderr
7Sep 11, 2026 20:5710,09694,285,34482,660,0001,143,0002,117,632stderr
8Sep 11, 2026 20:5710,12693,785,09382,900,0001,148,0002,117,632stderr
9Sep 11, 2026 20:5710,22795,200,81683,741,0001,151,0002,117,632stderr