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 17:53sheryllynn24sheryllynn24Score: 32,388Success
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 17:5332,093294,831,521262,370,0004,005,0002,265,088
2Sep 16, 2025 17:5332,378293,679,603266,737,0001,998,0002,269,184
3Sep 16, 2025 17:5332,378298,951,891264,740,0003,996,0002,277,376
4Sep 16, 2025 17:5332,380295,063,633266,752,0001,998,0002,277,376
5Sep 16, 2025 17:5332,388294,451,286265,824,0002,998,0002,260,992
6Sep 16, 2025 17:5332,490296,030,350267,671,0001,997,0002,277,376
7Sep 16, 2025 17:5333,471304,164,571275,812,0001,998,0002,273,280
8Sep 16, 2025 17:5333,488304,739,757273,952,0003,999,0002,277,376
9Sep 16, 2025 17:5333,500304,135,239274,053,0004,000,0002,277,376