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 listSep 1, 2026 07:16Victor MerckléVictor MerckléScore: 4,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 07:164,94549,489,50339,979,0001,071,0002,117,632stderr
2Sep 1, 2026 07:164,94749,219,63239,945,0001,119,0002,117,632stderr
3Sep 1, 2026 07:164,95349,608,42440,027,0001,088,0002,117,632stderr
4Sep 1, 2026 07:164,95749,303,58539,970,0001,177,0002,117,632stderr
5Sep 1, 2026 07:164,96149,571,10040,094,0001,085,0002,117,632stderr
6Sep 1, 2026 07:164,97849,706,13040,238,0001,086,0002,117,632stderr
7Sep 1, 2026 07:164,98749,591,51940,310,0001,083,0002,117,632stderr
8Sep 1, 2026 07:165,00150,669,40840,429,0001,082,0002,117,632stderr
9Sep 1, 2026 07:165,13751,031,80841,599,0001,041,0002,117,632stderr