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 16, 2024 16:02RecursiveCatnipRecursiveCatnipScore: 309,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 16:02309,8202,641,619,2892,571,504,70902,228,224
2Feb 16, 2024 16:02309,8902,637,225,4542,572,084,42202,228,224
3Feb 16, 2024 16:02371,1963,154,286,4373,080,929,69602,260,992