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 29, 2026 13:52Victor MerckléVictor MerckléScore: 3,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:553,89240,690,39531,188,0001,116,0002,117,632stderr
2Aug 29, 2026 13:553,91340,817,23631,367,0001,115,0002,117,632stderr
3Aug 29, 2026 13:553,91640,887,33331,389,0001,121,0002,117,632stderr
4Aug 29, 2026 13:553,92040,910,01931,435,0001,103,0002,117,632stderr
5Aug 29, 2026 13:553,92540,894,27431,537,0001,047,0002,117,632stderr
6Aug 29, 2026 13:553,92640,917,88631,467,0001,124,0002,117,632stderr
7Aug 29, 2026 13:553,93441,056,00231,501,0001,157,0002,117,632stderr
8Aug 29, 2026 13:553,93541,100,62431,601,0001,062,0002,117,632stderr
9Aug 29, 2026 13:553,94241,080,13031,665,0001,057,0002,117,632stderr