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 17, 2026 02:34Andrew EpsteinAndrew EpsteinScore: 9,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:349,84691,915,88280,550,0001,178,0002,117,632stderr
2Sep 17, 2026 02:349,88792,215,13280,901,0001,164,0002,117,632stderr
3Sep 17, 2026 02:349,93092,594,46381,240,0001,183,0002,117,632stderr
4Sep 17, 2026 02:349,93892,718,49581,295,0001,192,0002,117,632stderr
5Sep 17, 2026 02:349,96592,853,66281,537,0001,180,0002,117,632stderr
6Sep 17, 2026 02:349,98693,036,71081,689,0001,203,0002,117,632stderr
7Sep 17, 2026 02:3410,03093,451,04582,064,0001,193,0002,117,632stderr
8Sep 17, 2026 02:3410,03293,478,95882,069,0001,202,0002,117,632stderr
9Sep 17, 2026 02:3410,04593,578,80282,187,0001,189,0002,117,632stderr