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 listAug 15, 2025 13:58Serhat ErenSerhat ErenScore: 2,066,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2025 13:582,062,81917,153,410,22317,050,431,00070,968,0002,285,568
2Aug 15, 2025 13:582,064,25417,164,819,77417,071,337,00061,968,0002,277,376
3Aug 15, 2025 13:582,065,13817,174,828,47617,066,676,00073,968,0002,277,376
4Aug 15, 2025 13:582,065,31617,171,888,18317,077,147,00064,973,0002,277,376
5Aug 15, 2025 13:582,066,22417,183,192,01017,085,687,00063,976,0002,277,376
6Aug 15, 2025 13:582,066,25617,180,911,11317,074,959,00074,964,0002,289,664
7Aug 15, 2025 13:582,067,35717,188,897,74717,080,091,00078,968,0002,277,376
8Aug 15, 2025 13:582,068,93517,211,622,47917,098,199,00073,961,0002,277,376
9Aug 15, 2025 13:582,077,18517,273,791,87117,167,668,00072,968,0002,277,376