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 listDec 11, 2023 21:04metalcoffeemetalcoffeeScore: 517,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2023 21:04508,1994,288,070,7714,218,053,71602,236,416
2Dec 11, 2023 21:04508,3364,284,482,7564,219,191,37402,252,800
3Dec 11, 2023 21:04509,0424,291,226,6634,225,051,71502,240,512
4Dec 11, 2023 21:04517,1304,373,117,0034,292,175,58502,256,896
5Dec 11, 2023 21:04517,6704,360,482,5944,296,660,81302,252,800
6Dec 11, 2023 21:04521,3854,385,388,0624,327,492,39602,256,896