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 1, 2023 21:01Aleksandr DumarevskiiAleksandr DumarevskiiScore: 55,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2023 21:0355,523523,257,905460,842,32802,269,184
2Sep 1, 2023 21:0555,761532,977,962462,814,10602,260,992
3Sep 1, 2023 21:0555,770534,547,271462,891,01902,269,184
4Sep 1, 2023 21:0155,806530,308,021463,193,13602,265,088
5Sep 1, 2023 21:0355,871537,836,251463,729,57702,273,280
6Sep 1, 2023 21:0355,891531,635,364463,899,04102,265,088
7Sep 1, 2023 21:0155,899518,048,986463,961,02902,269,184
8Sep 1, 2023 21:0155,910535,779,761464,049,66802,252,800
9Sep 1, 2023 21:0555,936525,480,043464,266,99102,260,992