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 13, 2026 15:23Victor MerckléVictor MerckléScore: 7,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 15:237,98975,215,57865,168,0001,146,0002,113,536
2May 13, 2026 15:237,99073,581,55965,204,0001,115,0002,113,536
3May 13, 2026 15:237,99577,764,08565,194,0001,171,0002,113,536
4May 13, 2026 15:237,99675,588,01665,245,0001,122,0002,113,536
5May 13, 2026 15:237,99776,090,02365,267,0001,115,0002,113,536
6May 13, 2026 15:238,00575,296,33965,334,0001,110,0002,113,536
7May 13, 2026 15:238,00675,732,28665,355,0001,102,0002,113,536
8May 13, 2026 15:238,01075,659,96565,387,0001,098,0002,113,536
9May 13, 2026 15:238,01373,821,75765,394,0001,121,0002,113,536