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 10, 2026 16:22Victor MerckléVictor MerckléScore: 4,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 16:244,31443,962,37734,667,0001,142,0002,117,632stderr
2Aug 10, 2026 16:244,31443,964,71334,706,0001,107,0002,117,632stderr
3Aug 10, 2026 16:244,31544,381,21534,698,0001,124,0002,117,632stderr
4Aug 10, 2026 16:244,32844,172,29234,865,0001,058,0002,117,632stderr
5Aug 10, 2026 16:244,33444,106,74034,957,0001,019,0002,117,632stderr
6Aug 10, 2026 16:244,36244,484,70935,089,0001,121,0002,117,632stderr
7Aug 10, 2026 16:244,36544,431,43335,176,0001,057,0002,117,632stderr
8Aug 10, 2026 16:244,37244,500,59735,285,0001,008,0002,117,632stderr
9Aug 10, 2026 16:244,40444,658,51835,441,0001,119,0002,117,632stderr