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 22, 2026 15:03Kevin HeaveyKevin HeaveyScore: 4,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 15:034,16744,237,72033,510,0001,078,0002,113,536
2Jul 22, 2026 15:034,18244,476,91033,646,0001,071,0002,113,536
3Jul 22, 2026 15:034,23344,839,93034,056,0001,078,0002,113,536
4Jul 22, 2026 15:034,23844,958,48834,104,0001,077,0002,113,536
5Jul 22, 2026 15:034,28745,275,67634,486,0001,099,0002,113,536
6Jul 22, 2026 15:034,29045,301,66934,549,0001,066,0002,113,536
7Jul 22, 2026 15:034,36345,946,54135,117,0001,097,0002,113,536
8Jul 22, 2026 15:034,36445,995,51435,151,0001,074,0002,113,536
9Jul 22, 2026 15:034,43646,536,22635,613,0001,207,0002,113,536