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 06:32Victor MerckléVictor MerckléScore: 3,807Success
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 06:333,76339,567,97730,197,0001,044,0002,117,632stderr
2Sep 1, 2026 06:333,77039,978,78830,169,0001,126,0002,117,632stderr
3Sep 1, 2026 06:333,78040,502,24430,224,0001,156,0002,117,632stderr
4Sep 1, 2026 06:333,80739,952,55630,483,0001,119,0002,117,632stderr
5Sep 1, 2026 06:333,80740,730,10630,458,0001,146,0002,117,632stderr
6Sep 1, 2026 06:333,82440,141,14530,626,0001,120,0002,117,632stderr
7Sep 1, 2026 06:333,84240,361,92230,574,0001,316,0002,117,632stderr
8Sep 1, 2026 06:333,84540,314,40230,790,0001,130,0002,117,632stderr
9Sep 1, 2026 06:333,85041,018,93030,801,0001,161,0002,117,632stderr