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 21, 2026 13:25Victor MerckléVictor MerckléScore: 4,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 13:264,62946,074,49137,352,0001,070,0002,113,536
2May 21, 2026 13:264,63648,318,83437,402,0001,080,0002,113,536
3May 21, 2026 13:264,63647,962,89137,412,0001,068,0002,113,536
4May 21, 2026 13:264,63846,972,01837,426,0001,074,0002,113,536
5May 21, 2026 13:264,64648,298,99737,491,0001,071,0002,113,536
6May 21, 2026 13:264,65447,147,16437,606,0001,027,0002,113,536
7May 21, 2026 13:264,65447,873,25537,594,0001,038,0002,113,536
8May 21, 2026 13:264,65846,646,86637,633,0001,034,0002,113,536
9May 21, 2026 13:264,75350,068,11638,390,0001,061,0002,113,536