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 listMar 5, 2024 16:48RecursiveCatnipRecursiveCatnipScore: 36,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2024 16:4836,030359,660,111299,049,94602,232,320
2Mar 5, 2024 16:4836,190385,794,761300,377,38102,240,512
3Mar 5, 2024 16:4836,191363,485,128300,383,11002,236,416
4Mar 5, 2024 16:4836,193355,486,609300,405,33502,228,224
5Mar 5, 2024 16:4836,212360,133,481300,555,57602,232,320
6Mar 5, 2024 16:4836,221365,478,904300,638,13202,236,416