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 11, 2026 12:34Victor MerckléVictor MerckléScore: 4,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 12:353,99841,376,07831,999,0001,189,0002,117,632stderr
2Aug 11, 2026 12:354,00341,676,43231,950,0001,275,0002,117,632stderr
3Aug 11, 2026 12:354,01441,584,04832,091,0001,226,0002,117,632stderr
4Aug 11, 2026 12:354,01841,731,08032,169,0001,187,0002,117,632stderr
5Aug 11, 2026 12:354,03041,717,80632,262,0001,193,0002,117,632stderr
6Aug 11, 2026 12:354,04741,836,65832,407,0001,190,0002,117,632stderr
7Aug 11, 2026 12:354,05641,940,57532,644,0001,022,0002,117,632stderr
8Aug 11, 2026 12:354,07642,069,04932,638,0001,194,0002,117,632stderr
9Aug 11, 2026 12:354,24043,301,80334,045,0001,155,0002,117,632stderr