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 9, 2023 17:47gchebanovgchebanovScore: 12,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 17:4711,557165,224,86095,925,55802,269,184
2Jul 9, 2023 17:4711,560157,764,07095,949,19202,277,376
3Jul 9, 2023 17:4711,560155,914,48595,944,23502,265,088
4Jul 9, 2023 17:4712,332125,774,036101,355,0001,003,0002,281,472
5Jul 9, 2023 17:4712,340125,602,522101,417,0001,004,0002,281,472
6Jul 9, 2023 17:4712,341123,688,213101,428,0001,004,0002,514,944
7Jul 9, 2023 17:4712,342124,801,393101,436,0001,004,0002,281,472
8Jul 9, 2023 17:4712,376128,750,311100,730,0001,994,0002,281,472
9Jul 9, 2023 17:4712,382131,630,458100,779,0001,995,0002,281,472
10Jul 9, 2023 17:4712,384128,788,265100,789,0001,995,0002,514,944
11Jul 9, 2023 17:4712,396123,744,300100,892,0001,997,0002,519,040
12Jul 9, 2023 17:4712,636126,393,693102,882,0001,997,0002,523,136