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 21:25Kevin HeaveyKevin HeaveyScore: 3,786Success
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 21:293,54639,887,10328,251,0001,188,0002,113,536
2Jul 24, 2026 21:293,57940,156,45228,657,0001,049,0002,113,536
3Jul 24, 2026 21:293,60541,712,14528,702,0001,224,0002,113,536
4Jul 24, 2026 21:293,73842,662,14529,831,0001,195,0002,113,536
5Jul 24, 2026 21:293,78641,801,49030,220,0001,205,0002,113,536
6Jul 24, 2026 21:293,80842,785,49030,419,0001,194,0002,113,536
7Jul 24, 2026 21:293,82842,183,37330,545,0001,228,0002,113,536
8Jul 24, 2026 21:293,85147,129,54930,760,0001,210,0002,113,536
9Jul 24, 2026 21:293,86842,878,07130,899,0001,212,0002,113,536