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 17:08gchebanovgchebanovScore: 19,683Success
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 17:0819,606189,293,037144,758,00017,970,0002,457,600
2Jul 20, 2023 17:0819,610197,643,220153,721,0009,042,0002,514,944
3Jul 20, 2023 17:0819,626185,373,627153,903,0008,994,0002,527,232
4Jul 20, 2023 17:0819,636186,039,435140,979,00021,996,0002,441,216
5Jul 20, 2023 17:0819,660185,924,560145,162,00018,020,0002,281,472
6Jul 20, 2023 17:0819,663186,079,797151,191,00012,015,0002,445,312
7Jul 20, 2023 17:0819,683185,687,855148,335,00015,033,0002,437,120
8Jul 20, 2023 17:0819,868240,150,872164,903,72002,191,360
9Jul 20, 2023 17:0819,873188,746,737147,953,00016,994,0002,441,216
10Jul 20, 2023 17:0819,921238,379,490165,346,19202,207,744
11Jul 20, 2023 17:0820,238191,399,338152,981,00014,998,0002,506,752
12Jul 20, 2023 17:0820,454246,660,774169,771,46202,191,360