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 listOct 16, 2025 15:32Kirill020708Kirill020708Score: 2,023,161Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2025 15:322,020,44116,812,101,49616,706,690,00062,968,0002,277,376
2Oct 16, 2025 15:322,021,10716,811,299,98116,723,215,00051,975,0002,277,376
3Oct 16, 2025 15:322,021,47816,813,549,96616,708,300,00069,967,0002,277,376
4Oct 16, 2025 15:322,021,83416,816,018,75516,693,268,00087,953,0002,277,376
5Oct 16, 2025 15:322,023,16116,823,544,94116,717,270,00074,965,0002,289,664
6Oct 16, 2025 15:322,023,99616,833,490,09716,719,205,00079,962,0002,285,568
7Oct 16, 2025 15:322,027,11216,855,640,22416,760,065,00064,965,0002,289,664
8Oct 16, 2025 15:322,057,65517,111,622,61917,009,573,00068,965,0002,277,376
9Oct 16, 2025 15:322,165,02417,999,875,19417,912,725,00056,973,0002,277,376