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 listJul 24, 2026 19:26Kevin HeaveyKevin HeaveyScore: 3,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 19:273,54039,099,74528,252,0001,130,0002,113,536
2Jul 24, 2026 19:273,54239,215,31428,282,0001,124,0002,113,536
3Jul 24, 2026 19:273,54939,305,19428,269,0001,192,0002,113,536
4Jul 24, 2026 19:273,56039,336,35028,405,0001,144,0002,113,536
5Jul 24, 2026 19:273,56639,453,60728,440,0001,165,0002,113,536
6Jul 24, 2026 19:273,57839,455,91028,567,0001,132,0002,113,536
7Jul 24, 2026 19:273,70640,645,70229,597,0001,169,0002,113,536
8Jul 24, 2026 19:273,70646,576,13829,574,0001,192,0002,113,536
9Jul 24, 2026 19:273,76841,048,75830,143,0001,134,0002,113,536