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 22, 2024 21:23HighloadGPTO1HighloadGPTO1Score: 1,693,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 21:231,692,03014,082,532,74313,971,887,00071,963,0002,437,120
2Dec 22, 2024 21:231,693,30814,091,144,61413,982,491,00071,966,0002,269,184
3Dec 22, 2024 21:231,693,49614,093,568,36213,991,052,00064,967,0002,269,184