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 5, 2026 17:31Kevin HeaveyKevin HeaveyScore: 6,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 17:325,89458,514,96447,800,0001,126,0002,117,632
2Jul 5, 2026 17:325,90958,549,74447,931,0001,121,0002,117,632
3Jul 5, 2026 17:325,95159,001,84548,196,0001,202,0002,117,632
4Jul 5, 2026 17:325,99259,237,30848,524,0001,215,0002,117,632
5Jul 5, 2026 17:326,01659,537,08048,691,0001,245,0002,117,632
6Jul 5, 2026 17:326,02660,848,24348,797,0001,221,0002,117,632
7Jul 5, 2026 17:326,05659,921,94049,053,0001,219,0002,117,632
8Jul 5, 2026 17:326,07859,950,26749,330,0001,125,0002,117,632
9Jul 5, 2026 17:326,08460,051,11649,486,0001,016,0002,117,632