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 19:44Victor MerckléVictor MerckléScore: 3,802Success
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 19:453,76839,644,44830,164,0001,112,0002,117,632stderr
2Aug 23, 2026 19:453,77340,011,59930,209,0001,113,0002,117,632stderr
3Aug 23, 2026 19:453,78639,822,72930,273,0001,154,0002,117,632stderr
4Aug 23, 2026 19:453,78940,301,07030,258,0001,192,0002,117,632stderr
5Aug 23, 2026 19:453,80239,896,97530,483,0001,081,0002,117,632stderr
6Aug 23, 2026 19:453,80739,997,88330,472,0001,134,0002,117,632stderr
7Aug 23, 2026 19:453,80840,236,00030,421,0001,193,0002,117,632stderr
8Aug 23, 2026 19:453,88240,604,59031,204,0001,022,0002,117,632stderr
9Aug 23, 2026 19:453,89641,871,77131,185,0001,158,0002,117,632stderr