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 6, 2026 12:13Kevin HeaveyKevin HeaveyScore: 3,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 12:143,52637,750,30828,071,0001,198,0002,113,536
2Sep 6, 2026 12:143,54337,902,75928,211,0001,203,0002,113,536
3Sep 6, 2026 12:143,56238,740,08228,356,0001,216,0002,113,536
4Sep 6, 2026 12:143,57438,179,23828,479,0001,188,0002,113,536
5Sep 6, 2026 12:143,64339,498,82929,050,0001,189,0002,113,536
6Sep 6, 2026 12:143,67639,097,96329,295,0001,224,0002,113,536
7Sep 6, 2026 12:143,81740,895,68330,469,0001,218,0002,113,536
8Sep 6, 2026 12:143,83241,086,16630,586,0001,226,0002,113,536
9Sep 6, 2026 12:143,83341,031,49330,631,0001,189,0002,113,536