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 12, 2026 00:13Victor MerckléVictor MerckléScore: 10,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:1310,09692,505,97782,710,0001,088,0002,113,536
2May 12, 2026 00:1310,09692,567,65282,710,0001,094,0002,113,536
3May 12, 2026 00:1310,09694,662,54582,693,0001,112,0002,113,536
4May 12, 2026 00:1310,09993,221,31082,711,0001,117,0002,113,536
5May 12, 2026 00:1310,10793,104,68382,740,0001,155,0002,113,536
6May 12, 2026 00:1310,11292,705,32382,768,0001,167,0002,113,536
7May 12, 2026 00:1310,11393,018,99182,777,0001,166,0002,113,536
8May 12, 2026 00:1310,11594,777,56982,955,0001,007,0002,113,536
9May 12, 2026 00:1310,15093,330,35583,248,0001,003,0002,113,536