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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 22:244,28344,679,25531,386,0004,165,00024,576stderr
2Sep 7, 2026 22:244,33145,316,40631,783,0004,172,00024,576stderr
3Sep 7, 2026 22:244,36445,435,46231,855,0004,372,00024,576stderr
4Sep 7, 2026 22:244,37044,926,90432,172,0004,104,00024,576stderr
5Sep 7, 2026 22:244,41745,243,13831,799,0004,865,0002,117,632stderr
6Sep 7, 2026 22:244,42245,913,46632,063,0004,642,00024,576stderr
7Sep 7, 2026 22:244,42345,088,69132,012,0004,700,00024,576stderr
8Sep 7, 2026 22:244,43946,041,37532,049,0004,797,0002,117,632stderr
9Sep 7, 2026 22:244,50546,891,01633,485,0003,907,00024,576stderr