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 18, 2022 09:23RemyBRemyBScore: 201,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2022 09:23201,6061,730,629,4461,673,331,46902,232,320
2Jul 18, 2022 09:23201,6631,736,852,0011,673,805,05102,256,896
3Jul 18, 2022 09:23201,7031,735,059,2361,674,132,62602,240,512
4Jul 18, 2022 09:23201,7581,739,887,3201,674,592,08702,232,320
5Jul 18, 2022 09:23201,7801,721,756,9031,674,776,65702,240,512
6Jul 18, 2022 09:23201,8561,742,042,4291,675,405,20502,236,416