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 25, 2025 14:19SSScore: 2,066,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 14:192,062,71117,150,728,07517,053,537,00066,966,0002,510,848
2Aug 25, 2025 14:192,062,96817,159,302,42417,044,681,00077,957,0002,277,376
3Aug 25, 2025 14:192,065,40517,177,239,87717,075,892,00066,968,0002,510,848
4Aug 25, 2025 14:192,065,78517,181,714,33417,078,050,00067,964,0002,277,376
5Aug 25, 2025 14:192,066,15717,179,860,28317,079,132,00069,967,0002,285,568
6Aug 25, 2025 14:192,066,27817,181,432,37817,096,133,00053,972,0002,277,376
7Aug 25, 2025 14:192,066,60617,187,380,10917,083,861,00068,967,0002,289,664
8Aug 25, 2025 14:192,067,79117,200,792,27017,105,690,00056,972,0002,277,376
9Aug 25, 2025 14:192,206,10918,344,152,98918,242,737,00067,965,0002,277,376