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 24, 2026 18:45Victor MerckléVictor MerckléScore: 3,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 18:463,75139,542,49630,024,0001,111,0002,117,632stderr
2Aug 24, 2026 18:463,76339,645,69230,100,0001,135,0002,117,632stderr
3Aug 24, 2026 18:463,76640,424,26030,089,0001,174,0002,117,632stderr
4Aug 24, 2026 18:463,77739,773,21830,240,0001,111,0002,117,632stderr
5Aug 24, 2026 18:463,79039,845,03930,357,0001,107,0002,117,632stderr
6Aug 24, 2026 18:463,79939,947,51430,438,0001,094,0002,117,632stderr
7Aug 24, 2026 18:463,79939,908,02630,424,0001,112,0002,117,632stderr
8Aug 24, 2026 18:463,80140,992,00330,459,0001,092,0002,117,632stderr
9Aug 24, 2026 18:463,85040,125,04030,834,0001,126,0002,117,632stderr