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 listJun 28, 2023 03:57AlexanderAlexanderScore: 431,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2023 03:57430,4373,631,986,2733,572,627,21702,248,704
2Jun 28, 2023 03:57430,7283,644,397,6633,575,039,99402,236,416
3Jun 28, 2023 03:57431,0093,633,190,5753,577,375,27002,236,416
4Jun 28, 2023 03:57431,8383,652,138,7463,584,255,30902,244,608
5Jun 28, 2023 03:57434,2673,673,509,8063,604,414,77502,232,320
6Jun 28, 2023 03:57443,5783,739,766,3093,681,694,50902,236,416