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 25, 2026 02:46Victor MerckléVictor MerckléScore: 9,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 02:479,86090,214,02480,752,0001,090,0002,117,632stderr
2Aug 25, 2026 02:479,86690,240,02880,801,0001,089,0002,117,632stderr
3Aug 25, 2026 02:479,88690,461,72180,988,0001,071,0002,117,632stderr
4Aug 25, 2026 02:479,88790,486,97980,958,0001,109,0002,117,632stderr
5Aug 25, 2026 02:479,89390,475,17381,034,0001,082,0002,117,632stderr
6Aug 25, 2026 02:479,90190,603,99181,079,0001,106,0002,117,632stderr
7Aug 25, 2026 02:479,90790,662,25681,120,0001,109,0002,117,632stderr
8Aug 25, 2026 02:479,91090,609,69981,166,0001,088,0002,117,632stderr
9Aug 25, 2026 02:479,91590,708,57381,217,0001,078,0002,117,632stderr