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 17, 2026 20:14Kevin HeaveyKevin HeaveyScore: 3,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 20:293,74540,911,70230,044,0001,047,0002,113,536
2Jul 17, 2026 20:293,89542,760,19731,293,0001,043,0002,113,536
3Jul 17, 2026 20:293,90543,792,60631,370,0001,045,0002,113,536
4Jul 17, 2026 20:293,91643,783,14131,461,0001,046,0002,113,536
5Jul 17, 2026 20:293,93242,573,16031,591,0001,046,0002,113,536
6Jul 17, 2026 20:293,95744,009,99131,807,0001,043,0002,113,536
7Jul 17, 2026 20:293,96942,871,60731,905,0001,045,0002,113,536
8Jul 17, 2026 20:293,98843,099,01632,065,0001,043,0002,113,536
9Jul 17, 2026 20:294,01443,192,66832,279,0001,042,0002,113,536