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 listAug 25, 2026 12:26Victor MerckléVictor MerckléScore: 9,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 12:279,24785,088,42875,749,0001,007,0002,117,632stderr
2Aug 25, 2026 12:279,25185,137,57075,773,0001,011,0002,117,632stderr
3Aug 25, 2026 12:279,27285,317,97875,918,0001,040,0002,117,632stderr
4Aug 25, 2026 12:279,29285,485,91676,067,0001,060,0002,117,632stderr
5Aug 25, 2026 12:279,29285,513,34976,093,0001,036,0002,117,632stderr
6Aug 25, 2026 12:279,33285,817,73176,423,0001,036,0002,117,632stderr
7Aug 25, 2026 12:279,37986,724,50676,690,0001,158,0002,117,632stderr
8Aug 25, 2026 12:279,40087,052,71676,990,0001,033,0002,117,632stderr
9Aug 25, 2026 12:279,40986,460,45177,081,0001,014,0002,117,632stderr