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 02:26Victor MerckléVictor MerckléScore: 7,039Success
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 02:276,99967,115,45456,960,0001,135,0002,117,632stderr
2Aug 25, 2026 02:277,02666,693,49857,222,0001,097,0002,117,632stderr
3Aug 25, 2026 02:277,02866,727,10857,103,0001,234,0002,117,632stderr
4Aug 25, 2026 02:277,02866,711,21557,246,0001,091,0002,117,632stderr
5Aug 25, 2026 02:277,03966,831,43157,311,0001,118,0002,117,632stderr
6Aug 25, 2026 02:277,07867,140,15657,651,0001,101,0002,117,632stderr
7Aug 25, 2026 02:277,08167,178,83957,679,0001,100,0002,117,632stderr
8Aug 25, 2026 02:277,21668,406,71158,741,0001,156,0002,117,632stderr
9Aug 25, 2026 02:277,25568,623,58759,115,0001,103,0002,117,632stderr