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 11:25Victor MerckléVictor MerckléScore: 4,694Success
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 11:264,67946,690,59937,771,0001,071,0002,113,536
2May 21, 2026 11:264,68246,693,23237,782,0001,083,0002,113,536
3May 21, 2026 11:264,69347,542,61337,952,0001,005,0002,113,536
4May 21, 2026 11:264,69346,917,27837,945,0001,010,0002,113,536
5May 21, 2026 11:264,69448,393,45737,899,0001,067,0002,113,536
6May 21, 2026 11:264,69946,881,00138,001,0001,005,0002,113,536
7May 21, 2026 11:264,70048,087,54738,008,0001,009,0002,113,536
8May 21, 2026 11:264,74049,684,19138,313,0001,037,0002,113,536
9May 21, 2026 11:264,81047,707,11338,907,0001,016,0002,113,536