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 listFeb 21, 2023 13:43qwikman1qwikman1Score: 1,641,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2023 13:431,632,05213,602,667,93513,546,031,32102,252,800
2Feb 21, 2023 13:431,641,77713,698,556,53313,626,751,30202,260,992
3Feb 21, 2023 13:431,643,05513,705,775,10913,637,360,60002,256,896