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 16:06Kevin HeaveyKevin HeaveyScore: 3,741Success
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 16:073,63239,847,35629,100,0001,046,0002,117,632
2Jul 17, 2026 16:073,68640,399,87829,550,0001,049,0002,117,632
3Jul 17, 2026 16:073,68940,347,49429,376,0001,249,0002,117,632
4Jul 17, 2026 16:073,69242,067,21629,599,0001,051,0002,117,632
5Jul 17, 2026 16:073,74140,864,62830,007,0001,048,0002,117,632
6Jul 17, 2026 16:073,80941,412,62330,571,0001,050,0002,117,632
7Jul 17, 2026 16:073,81541,418,80430,626,0001,042,0002,117,632
8Jul 17, 2026 16:073,86141,875,77431,010,0001,042,0002,117,632
9Jul 17, 2026 16:073,90943,260,56031,401,0001,045,0002,117,632