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 2, 2021 06:44xxScore: 65,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2021 07:0165,636611,501,235544,779,34402,289,664
2Jul 2, 2021 06:4465,637609,542,894544,786,89602,281,472
3Jul 2, 2021 06:4465,642606,375,147544,828,99102,289,664
4Jul 2, 2021 06:4465,664606,885,384545,010,28202,289,664
5Jul 2, 2021 06:4465,670605,024,289545,062,30202,289,664
6Jul 2, 2021 07:0165,673603,826,251545,083,38602,285,568
7Jul 2, 2021 07:0165,687608,800,625545,202,18702,301,952
8Jul 2, 2021 06:4465,688611,428,367545,213,62602,293,760
9Jul 2, 2021 06:4465,750618,269,576545,722,73102,293,760