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:47Victor MerckléVictor MerckléScore: 3,826Success
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:483,80139,903,51930,309,0001,243,0002,117,632stderr
2Sep 1, 2026 07:483,80239,973,92830,258,0001,303,0002,117,632stderr
3Sep 1, 2026 07:483,81440,093,93030,409,0001,248,0002,117,632stderr
4Sep 1, 2026 07:483,81740,751,40330,436,0001,249,0002,117,632stderr
5Sep 1, 2026 07:483,82640,153,09030,509,0001,251,0002,117,632stderr
6Sep 1, 2026 07:483,82940,910,72130,523,0001,259,0002,117,632stderr
7Sep 1, 2026 07:483,83240,213,86330,543,0001,270,0002,117,632stderr
8Sep 1, 2026 07:483,85241,000,10530,727,0001,249,0002,117,632stderr
9Sep 1, 2026 07:483,85441,027,12230,750,0001,241,0002,117,632stderr