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 24, 2026 14:02Victor MerckléVictor MerckléScore: 4,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 14:034,57646,504,71336,914,0001,070,0002,113,536
2May 24, 2026 14:034,58146,251,90936,953,0001,076,0002,113,536
3May 24, 2026 14:034,58547,742,76336,981,0001,078,0002,113,536
4May 24, 2026 14:034,59146,720,44537,084,0001,024,0002,113,536
5May 24, 2026 14:034,59248,309,70037,073,0001,047,0002,113,536
6May 24, 2026 14:034,60046,327,95737,170,0001,011,0002,113,536
7May 24, 2026 14:034,60546,586,71537,168,0001,060,0002,113,536
8May 24, 2026 14:034,61246,285,14637,257,0001,024,0002,113,536
9May 24, 2026 14:034,65746,419,63637,653,0001,007,0002,113,536