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 11, 2026 12:04Victor MerckléVictor MerckléScore: 4,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 12:054,51745,956,10636,396,0001,102,0002,117,632stderr
2Aug 11, 2026 12:054,52145,932,56836,485,0001,044,0002,117,632stderr
3Aug 11, 2026 12:054,52447,052,83136,498,0001,053,0002,117,632stderr
4Aug 11, 2026 12:054,52645,976,81136,505,0001,067,0002,117,632stderr
5Aug 11, 2026 12:054,54046,093,77436,586,0001,098,0002,117,632stderr
6Aug 11, 2026 12:054,56546,236,19236,852,0001,044,0002,117,632stderr
7Aug 11, 2026 12:054,56746,349,18636,846,0001,063,0002,117,632stderr
8Aug 11, 2026 12:054,57346,350,12336,837,0001,120,0002,117,632stderr
9Aug 11, 2026 12:054,62846,884,65537,317,0001,097,0002,117,632stderr