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 listSep 11, 2026 19:20Victor MerckléVictor MerckléScore: 10,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 19:2310,41196,509,67083,578,0002,834,00024,576stderr
2Sep 11, 2026 19:2310,47995,677,10283,801,0003,175,0002,117,632stderr
3Sep 11, 2026 19:2310,52296,068,04984,359,0002,978,0002,117,632stderr
4Sep 11, 2026 19:2310,53896,273,08185,797,0001,669,00024,576stderr
5Sep 11, 2026 19:2310,54596,189,96885,899,0001,629,00024,576stderr
6Sep 11, 2026 19:2310,55697,849,10184,833,0002,784,0002,117,632stderr
7Sep 11, 2026 19:2310,56596,503,58985,488,0002,208,0002,117,632stderr
8Sep 11, 2026 19:2310,57196,398,95284,761,0002,982,0002,117,632stderr
9Sep 11, 2026 19:2310,60596,646,24486,368,0001,660,00024,576stderr