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 26, 2026 03:50Victor MerckléVictor MerckléScore: 3,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 03:503,78239,695,30330,339,0001,059,0002,117,632stderr
2Aug 26, 2026 03:503,78739,619,73530,402,0001,035,0002,117,632stderr
3Aug 26, 2026 03:503,79140,959,94530,367,0001,105,0002,117,632stderr
4Aug 26, 2026 03:503,79639,767,49230,415,0001,097,0002,117,632stderr
5Aug 26, 2026 03:503,79939,874,21130,451,0001,088,0002,117,632stderr
6Aug 26, 2026 03:503,80439,702,42730,425,0001,149,0002,117,632stderr
7Aug 26, 2026 03:503,81540,017,08130,543,0001,127,0002,117,632stderr
8Aug 26, 2026 03:503,82639,947,72630,698,0001,066,0002,117,632stderr
9Aug 26, 2026 03:504,06142,833,28932,586,0001,121,0002,117,632stderr