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 18:00Victor MerckléVictor MerckléScore: 4,038Success
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 18:024,00541,557,42132,221,0001,025,0002,117,632stderr
2Aug 11, 2026 18:024,01041,582,98532,257,0001,028,0002,117,632stderr
3Aug 11, 2026 18:024,02341,797,51532,251,0001,141,0002,117,632stderr
4Aug 11, 2026 18:024,03641,766,50732,403,0001,097,0002,117,632stderr
5Aug 11, 2026 18:024,03841,814,59632,381,0001,138,0002,117,632stderr
6Aug 11, 2026 18:024,07142,134,96032,774,0001,018,0002,117,632stderr
7Aug 11, 2026 18:024,07542,127,60332,778,0001,048,0002,117,632stderr
8Aug 11, 2026 18:024,18544,289,40433,680,0001,061,0002,117,632stderr
9Aug 11, 2026 18:024,25043,497,04234,199,0001,082,0002,117,632stderr