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 23, 2026 18:13Victor MerckléVictor MerckléScore: 3,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:143,83340,185,58630,681,0001,135,0002,117,632stderr
2Aug 23, 2026 18:143,84440,297,65230,839,0001,072,0002,117,632stderr
3Aug 23, 2026 18:143,84440,865,42730,819,0001,089,0002,117,632stderr
4Aug 23, 2026 18:143,84840,973,02030,798,0001,143,0002,117,632stderr
5Aug 23, 2026 18:143,85240,449,85230,816,0001,159,0002,117,632stderr
6Aug 23, 2026 18:143,86840,501,80430,992,0001,117,0002,117,632stderr
7Aug 23, 2026 18:144,01342,294,10832,173,0001,139,0002,117,632stderr
8Aug 23, 2026 18:144,05849,006,15332,452,0001,237,0002,117,632stderr
9Aug 23, 2026 18:144,07742,180,18932,763,0001,078,0002,117,632stderr