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 21, 2026 09:20Kevin HeaveyKevin HeaveyScore: 61,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 09:223,55939,168,98428,349,0001,191,0002,113,536
2Jul 21, 2026 09:223,56039,228,70928,503,0001,046,0002,113,536
3Jul 21, 2026 09:223,56839,259,08728,548,0001,071,0002,113,536
4Jul 21, 2026 09:2261,262518,926,284507,422,0001,055,0002,113,536
5Jul 21, 2026 09:2261,278518,252,483507,426,0001,187,0002,113,536
6Jul 21, 2026 09:2261,664521,397,214510,729,0001,085,0002,113,536
7Jul 21, 2026 09:2262,548528,847,171518,097,0001,053,0002,113,536
8Jul 21, 2026 09:2262,760530,525,061519,732,0001,178,0002,113,536
9Jul 21, 2026 09:2262,790533,875,335520,102,0001,055,0002,113,536