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 19, 2026 15:32Kevin HeaveyKevin HeaveyScore: 10,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 15:3210,36295,865,66084,999,0001,011,0002,113,536
2Jul 19, 2026 15:3210,40396,121,62385,336,0001,011,0002,113,536
3Jul 19, 2026 15:3210,50197,596,74486,149,0001,011,0002,113,536
4Jul 19, 2026 15:3210,50997,634,40986,215,0001,011,0002,113,536
5Jul 19, 2026 15:3210,51197,670,50986,234,0001,012,0002,113,536
6Jul 19, 2026 15:3210,51797,512,00686,282,0001,011,0002,113,536
7Jul 19, 2026 15:3210,51997,692,65786,297,0001,011,0002,113,536
8Jul 19, 2026 15:3210,51997,126,61686,297,0001,011,0002,113,536
9Jul 19, 2026 15:3210,52797,104,69086,365,0001,011,0002,113,536