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 listSep 10, 2021 06:04Andrey TsvetkovAndrey TsvetkovScore: 41,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2021 06:0441,516416,346,345344,583,54502,203,648
2Sep 10, 2021 06:0641,521400,517,869344,623,45202,207,744
3Sep 10, 2021 06:0441,526400,891,380344,665,65802,215,936
4Sep 10, 2021 06:0441,531408,449,165344,707,26002,215,936
5Sep 10, 2021 06:0641,535400,960,928344,741,90102,211,840
6Sep 10, 2021 06:0441,539404,984,155344,774,42502,220,032
7Sep 10, 2021 06:0441,542404,174,375344,797,10402,211,840
8Sep 10, 2021 06:0641,547408,189,226344,840,68502,211,840
9Sep 10, 2021 06:0441,558397,364,219344,934,30502,215,936