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 listJul 20, 2023 18:16gchebanovgchebanovScore: 14,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2023 18:1614,485143,069,163118,226,0002,003,0002,293,760
2Jul 20, 2023 18:1614,490142,922,668119,264,0001,002,0002,289,664
3Jul 20, 2023 18:1614,499149,246,727118,335,0002,005,0002,281,472
4Jul 20, 2023 18:1614,509144,567,920118,416,0002,007,0002,265,088
5Jul 20, 2023 18:1614,514141,852,296119,461,0001,003,0002,383,872
6Jul 20, 2023 18:1614,517143,082,288119,489,0001,004,0002,461,696
7Jul 20, 2023 18:1614,869215,036,840123,414,40402,293,760
8Jul 20, 2023 18:1614,983195,005,838124,360,16102,285,568
9Jul 20, 2023 18:1614,993179,701,315124,443,35302,277,376
10Jul 20, 2023 18:1615,307149,407,786125,050,0002,000,0002,428,928
11Jul 20, 2023 18:1615,333150,335,400126,259,0001,002,0002,531,328
12Jul 20, 2023 18:1615,357151,189,106126,456,0001,003,0002,265,088