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 listSep 7, 2026 20:42Victor MerckléVictor MerckléScore: 4,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 20:434,23943,495,69031,485,0003,704,00024,576stderr
2Sep 7, 2026 20:434,25143,572,87031,314,0003,977,00024,576stderr
3Sep 7, 2026 20:434,28844,753,41631,273,0004,318,00024,576stderr
4Sep 7, 2026 20:434,28944,677,34831,336,0004,265,00024,576stderr
5Sep 7, 2026 20:434,30644,884,93531,348,0004,396,00024,576stderr
6Sep 7, 2026 20:434,31744,308,94731,292,0004,541,00024,576stderr
7Sep 7, 2026 20:434,32644,165,37331,444,0004,470,00024,576stderr
8Sep 7, 2026 20:434,33144,468,47231,510,0004,443,00024,576stderr
9Sep 7, 2026 20:434,33344,268,59031,495,0004,475,00024,576stderr