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, 2026 01:30Victor MerckléVictor MerckléScore: 4,150Success
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, 2026 01:314,10342,442,37932,919,0001,140,0002,117,632stderr
2Aug 25, 2026 01:314,10942,452,26332,956,0001,149,0002,117,632stderr
3Aug 25, 2026 01:314,12342,524,38333,147,0001,081,0002,117,632stderr
4Aug 25, 2026 01:314,12342,608,61733,116,0001,108,0002,117,632stderr
5Aug 25, 2026 01:314,15042,757,65333,371,0001,074,0002,117,632stderr
6Aug 25, 2026 01:314,15842,899,27333,443,0001,075,0002,117,632stderr
7Aug 25, 2026 01:314,19152,509,73933,711,0001,075,0002,117,632stderr
8Aug 25, 2026 01:314,34344,418,12234,996,0001,059,0002,117,632stderr
9Aug 25, 2026 01:314,47745,449,82636,072,0001,094,0002,117,632stderr