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 24, 2025 16:07Leon ZhaoLeon ZhaoScore: 2,067,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2025 16:072,065,00117,177,969,88017,077,535,00061,976,0002,285,568
2Jul 24, 2025 16:072,065,73017,181,085,59517,083,587,00061,973,0002,289,664
3Jul 24, 2025 16:072,066,52717,187,587,03417,083,200,00068,972,0002,277,376
4Jul 24, 2025 16:072,067,31717,186,116,99217,093,757,00064,972,0002,277,376
5Jul 24, 2025 16:072,067,72517,189,921,34517,096,143,00065,973,0002,277,376
6Jul 24, 2025 16:072,070,11317,215,356,19317,109,972,00071,966,0002,277,376
7Jul 24, 2025 16:072,073,87817,243,895,85817,124,228,00088,959,0002,289,664
8Jul 24, 2025 16:072,078,02017,282,540,07417,175,603,00071,964,0002,277,376
9Jul 24, 2025 16:072,238,65218,617,730,29818,504,843,00075,970,0002,277,376