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 listMay 24, 2026 15:31Victor MerckléVictor MerckléScore: 7,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 15:317,29668,309,83459,510,0001,055,0002,113,536
2May 24, 2026 15:317,29970,080,76459,537,0001,046,0002,113,536
3May 24, 2026 15:317,30668,743,21159,582,0001,061,0002,113,536
4May 24, 2026 15:317,30769,442,11759,540,0001,110,0002,113,536
5May 24, 2026 15:317,31670,381,26359,591,0001,132,0002,113,536
6May 24, 2026 15:317,36068,886,92160,050,0001,043,0002,113,536
7May 24, 2026 15:317,36171,138,44560,044,0001,057,0002,113,536
8May 24, 2026 15:317,36170,159,94860,049,0001,054,0002,113,536
9May 24, 2026 15:317,36269,129,11060,069,0001,042,0002,113,536