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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 08:334,60646,030,87537,146,0001,091,0002,117,632stderr
2May 22, 2026 08:334,61846,080,10037,246,0001,091,0002,117,632stderr
3May 22, 2026 08:334,62046,251,21037,254,0001,099,0002,117,632stderr
4May 22, 2026 08:334,62446,153,62137,377,0001,007,0002,117,632stderr
5May 22, 2026 08:334,63046,944,45637,341,0001,088,0002,117,632stderr
6May 22, 2026 08:334,63147,574,00437,424,0001,015,0002,117,632stderr
7May 22, 2026 08:334,63546,705,37337,442,0001,036,0002,117,632stderr
8May 22, 2026 08:334,63946,609,68137,505,0001,002,0002,117,632stderr
9May 22, 2026 08:334,64046,275,36137,488,0001,031,0002,117,632stderr