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 20, 2025 20:15sheryllynn24sheryllynn24Score: 9,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 20:159,276105,559,10174,995,0001,999,0002,519,040
2Sep 20, 2025 20:159,279112,841,36375,014,0002,000,0002,285,568
3Sep 20, 2025 20:159,284106,124,91275,059,0002,001,0002,514,944
4Sep 20, 2025 20:159,662106,184,51779,192,0001,002,0002,285,568
5Sep 20, 2025 20:159,671108,759,33078,263,0002,006,0002,510,848
6Sep 20, 2025 20:159,673110,532,49178,279,0002,007,0002,285,568
7Sep 20, 2025 20:159,674106,203,47578,291,0002,007,0002,285,568
8Sep 20, 2025 20:159,675113,840,74878,299,0002,007,0002,285,568
9Sep 20, 2025 20:159,675106,204,37378,297,0002,007,0002,523,136
10Sep 20, 2025 20:159,676110,082,18778,300,0002,007,0002,510,848
11Sep 20, 2025 20:159,676109,577,89078,305,0002,007,0002,260,992
12Sep 20, 2025 20:159,682110,950,44878,350,0002,008,0002,285,568