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 21, 2025 07:56sheryllynn24sheryllynn24Score: 9,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2025 07:568,822104,498,51071,215,0002,006,0002,527,232
2Sep 21, 2025 07:568,825105,236,62071,243,0002,006,0002,289,664
3Sep 21, 2025 07:568,843101,862,87971,384,0002,010,0002,387,968
4Sep 21, 2025 07:569,282103,090,42475,042,0002,001,0002,289,664
5Sep 21, 2025 07:569,286104,492,59475,073,0002,001,0002,514,944
6Sep 21, 2025 07:569,386109,215,94775,904,0001,997,0002,289,664
7Sep 21, 2025 07:569,389106,030,88375,928,0001,998,0002,289,664
8Sep 21, 2025 07:569,390104,319,36475,936,0001,998,0002,289,664
9Sep 21, 2025 07:569,393105,842,42675,964,0001,999,0002,289,664
10Sep 21, 2025 07:569,397111,594,65475,995,0001,999,0002,383,872
11Sep 21, 2025 07:569,403107,367,61576,040,0002,001,0002,527,232
12Sep 21, 2025 07:569,410107,503,58975,103,0003,004,0002,289,664