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 16, 2025 16:48sheryllynn24sheryllynn24Score: 510,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2025 16:48510,0564,262,657,9554,230,464,0002,998,0002,277,376
2Sep 16, 2025 16:48510,0874,270,009,6144,230,720,0002,998,0002,506,752
3Sep 16, 2025 16:48510,1024,269,238,0944,230,845,0002,998,0002,260,992
4Sep 16, 2025 16:48510,1604,262,393,2944,231,332,0002,998,0002,277,376
5Sep 16, 2025 16:48510,1654,260,890,2934,230,376,0003,997,0002,277,376
6Sep 16, 2025 16:48510,1954,268,132,2074,231,624,0002,997,0002,277,376
7Sep 16, 2025 16:48510,3364,269,669,4144,233,793,0001,998,0002,277,376
8Sep 16, 2025 16:48510,4304,270,550,1854,230,571,0005,996,0002,277,376
9Sep 16, 2025 16:48510,4634,265,509,2364,234,844,0001,998,0002,265,088