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:24Victor MerckléVictor MerckléScore: 3,903Success
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:253,85540,477,63630,786,0001,217,0002,117,632stderr
2Aug 11, 2026 12:253,86940,275,43330,913,0001,202,0002,117,632stderr
3Aug 11, 2026 12:253,88340,622,41131,017,0001,216,0002,117,632stderr
4Aug 11, 2026 12:253,89540,511,83631,161,0001,169,0002,117,632stderr
5Aug 11, 2026 12:253,90341,105,02231,147,0001,250,0002,117,632stderr
6Aug 11, 2026 12:253,92040,922,50631,323,0001,219,0002,117,632stderr
7Aug 11, 2026 12:253,92040,737,76031,526,0001,018,0002,117,632stderr
8Aug 11, 2026 12:253,97041,354,59131,783,0001,174,0002,117,632stderr
9Aug 11, 2026 12:254,00241,582,50732,069,0001,155,0002,117,632stderr