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:36Victor MerckléVictor MerckléScore: 3,801Success
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:373,78639,811,90330,260,0001,170,0002,117,632stderr
2Aug 23, 2026 18:373,79039,852,32930,422,0001,038,0002,117,632stderr
3Aug 23, 2026 18:373,79339,884,49530,336,0001,154,0002,117,632stderr
4Aug 23, 2026 18:373,79539,840,70130,442,0001,059,0002,117,632stderr
5Aug 23, 2026 18:373,80139,920,82630,417,0001,132,0002,117,632stderr
6Aug 23, 2026 18:373,81039,938,60130,581,0001,045,0002,117,632stderr
7Aug 23, 2026 18:373,83940,223,14530,819,0001,045,0002,117,632stderr
8Aug 23, 2026 18:373,84040,222,55630,696,0001,179,0002,117,632stderr
9Aug 23, 2026 18:373,85340,335,36630,819,0001,162,0002,117,632stderr