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 18, 2025 13:34sheryllynn24sheryllynn24Score: 15,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2025 13:3415,802161,348,292128,152,0003,003,0002,273,280
2Sep 18, 2025 13:3415,835158,153,963130,431,0001,003,0002,519,040
3Sep 18, 2025 13:3415,853158,216,029129,572,0002,008,0002,273,280
4Sep 18, 2025 13:3415,856158,193,803129,613,0001,994,0002,277,376
5Sep 18, 2025 13:3415,873162,355,357129,752,0001,996,0002,273,280
6Sep 18, 2025 13:3415,890155,614,491130,887,000999,0002,273,280
7Sep 18, 2025 13:3415,948157,596,161131,367,0001,002,0002,519,040
8Sep 18, 2025 13:3416,269166,162,808134,033,0001,000,0002,277,376
9Sep 18, 2025 13:3416,287161,494,990131,176,0004,005,0002,277,376