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,903Success
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,705144,431,345121,050,0001,000,0002,293,760
2Jul 20, 2023 18:1614,710143,949,876119,087,0003,002,0002,396,160
3Jul 20, 2023 18:1614,710142,564,090121,091,0001,000,0002,461,696
4Jul 20, 2023 18:1614,732147,822,953120,268,0002,004,0002,269,184
5Jul 20, 2023 18:1614,746145,821,123120,398,0001,990,0002,445,312
6Jul 20, 2023 18:1614,893190,571,849123,614,79502,285,568
7Jul 20, 2023 18:1614,903184,120,558123,695,13302,293,760
8Jul 20, 2023 18:1614,990187,132,027124,419,93202,277,376
9Jul 20, 2023 18:1615,031152,657,865122,762,0001,996,0002,277,376
10Jul 20, 2023 18:1615,031152,027,069122,764,0001,996,0002,281,472
11Jul 20, 2023 18:1615,566153,348,668128,198,0001,001,0002,527,232
12Jul 20, 2023 18:1615,571152,943,979127,235,0002,003,0002,519,040