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 18, 2026 14:38Kevin HeaveyKevin HeaveyScore: 3,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 14:433,68540,348,53729,537,0001,050,0002,113,536
2Jul 18, 2026 14:433,68640,378,35629,531,0001,064,0002,113,536
3Jul 18, 2026 14:433,68640,351,79829,555,0001,044,0002,113,536
4Jul 18, 2026 14:433,68840,462,94929,567,0001,048,0002,113,536
5Jul 18, 2026 14:433,70240,579,07229,683,0001,046,0002,113,536
6Jul 18, 2026 14:433,77241,188,96930,268,0001,046,0002,113,536
7Jul 18, 2026 14:433,94042,500,66731,663,0001,043,0002,113,536
8Jul 18, 2026 14:433,94042,492,83031,661,0001,049,0002,113,536
9Jul 18, 2026 14:433,94542,601,57231,729,0001,020,0002,113,536