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 14, 2026 10:59Kevin HeaveyKevin HeaveyScore: 3,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 11:043,54638,248,25628,222,0001,217,0002,113,536
2Sep 14, 2026 11:043,54638,172,67028,239,0001,201,0002,113,536
3Sep 14, 2026 11:043,55238,267,80028,263,0001,219,0002,113,536
4Sep 14, 2026 11:043,55438,237,18728,268,0001,236,0002,113,536
5Sep 14, 2026 11:043,55438,257,80628,462,0001,037,0002,113,536
6Sep 14, 2026 11:043,56038,375,34128,350,0001,206,0002,113,536
7Sep 14, 2026 11:043,56138,337,36928,351,0001,211,0002,113,536
8Sep 14, 2026 11:043,66039,045,84929,330,0001,048,0002,113,536
9Sep 14, 2026 11:043,80441,028,65130,378,0001,199,0002,113,536