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 listJun 28, 2026 18:16glegleScore: 43,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 18:1743,113367,282,180355,826,0002,019,0002,125,824
2Jun 28, 2026 18:1743,126367,480,601355,932,0002,016,0002,125,824
3Jun 28, 2026 18:1743,131367,472,182355,984,0002,005,0002,125,824
4Jun 28, 2026 18:1743,133368,703,573356,001,0002,007,0002,125,824
5Jun 28, 2026 18:1743,134367,897,078355,909,0002,105,0002,125,824
6Jun 28, 2026 18:1743,139368,053,429355,958,0002,101,0002,125,824
7Jun 28, 2026 18:1743,140367,602,402356,057,0002,005,0002,125,824
8Jun 28, 2026 18:1743,150369,409,178356,044,0002,107,0002,125,824
9Jun 28, 2026 18:1743,156367,632,663356,108,0002,090,0002,125,824