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 listDec 3, 2025 18:42Rajarshi BasuRajarshi BasuScore: 8,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 18:428,27096,239,24768,640,00002,289,664
2Dec 3, 2025 18:428,286101,981,83966,783,0001,993,0002,289,664
3Dec 3, 2025 18:428,287101,687,26766,788,0001,993,0002,289,664
4Dec 3, 2025 18:428,28894,659,19066,799,0001,994,0002,289,664
5Dec 3, 2025 18:428,288100,066,97667,795,000996,0002,289,664
6Dec 3, 2025 18:428,29094,814,55766,811,0001,994,0002,494,464
7Dec 3, 2025 18:428,29289,345,70965,835,0002,992,0002,494,464
8Dec 3, 2025 18:428,29394,822,16366,834,0001,995,0002,289,664
9Dec 3, 2025 18:428,29992,305,75466,886,0001,996,0002,502,656
10Dec 3, 2025 18:428,45988,044,42869,207,0001,003,0002,498,560
11Dec 3, 2025 18:428,47893,791,78969,364,0001,005,0002,486,272
12Dec 3, 2025 18:428,48394,128,37868,401,0002,011,0002,289,664