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 8, 2026 05:58Victor MerckléVictor MerckléScore: 8,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 05:588,19776,573,55861,095,0006,944,0002,117,632stderr
2Sep 8, 2026 05:588,22576,745,39061,435,0006,838,00024,576stderr
3Sep 8, 2026 05:588,23576,853,66361,392,0006,964,00024,576stderr
4Sep 8, 2026 05:588,26877,198,22961,169,0007,462,00024,576stderr
5Sep 8, 2026 05:588,45478,687,94763,277,0006,898,00024,576stderr
6Sep 8, 2026 05:588,57379,684,07461,874,0009,287,00024,576stderr
7Sep 8, 2026 05:588,60579,875,68662,729,0008,693,00024,576stderr
8Sep 8, 2026 05:588,63280,168,42264,202,0007,445,0002,117,632stderr
9Sep 8, 2026 05:588,64480,196,49062,199,0009,547,0002,117,632stderr