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 7, 2026 21:24Victor MerckléVictor MerckléScore: 4,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 21:264,18243,096,57230,681,0004,033,00024,576stderr
2Sep 7, 2026 21:264,18543,332,31130,830,0003,911,00024,576stderr
3Sep 7, 2026 21:264,19243,090,30830,691,0004,105,00024,576stderr
4Sep 7, 2026 21:264,21043,217,53130,484,0004,460,00024,576stderr
5Sep 7, 2026 21:264,21043,515,81230,790,0004,153,00024,576stderr
6Sep 7, 2026 21:264,24944,609,43630,906,0004,366,00024,576stderr
7Sep 7, 2026 21:264,29244,337,09930,798,0004,833,0002,117,632stderr
8Sep 7, 2026 21:264,29944,380,25530,600,0005,085,0002,117,632stderr
9Sep 7, 2026 21:264,31445,036,84031,007,0004,804,0002,117,632stderr