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:44AlexanderAlexanderScore: 487,496Success
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:44487,2414,101,724,4354,044,097,98202,265,088
2Jun 28, 2023 03:43487,3354,105,743,5724,044,881,42202,252,800
3Jun 28, 2023 03:43487,4554,105,905,4494,045,873,33102,252,800
4Jun 28, 2023 03:44487,4964,106,739,5224,046,220,35502,260,992
5Jun 28, 2023 03:43488,5844,111,079,6694,055,247,45602,260,992
6Jun 28, 2023 03:44495,3284,179,652,5584,111,220,65402,265,088