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 11, 2023 21:15metalcoffeemetalcoffeeScore: 509,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2023 21:05508,2994,283,591,6684,218,883,74902,236,416
2Dec 11, 2023 21:05508,3384,273,319,9064,219,207,62102,236,416
3Dec 11, 2023 21:15508,4664,283,638,2634,220,263,80002,236,416
4Dec 11, 2023 21:15509,9564,299,209,9124,232,631,36502,252,800
5Dec 11, 2023 21:05510,0474,299,824,2604,233,389,43602,252,800
6Dec 11, 2023 21:15510,1084,305,495,5064,233,900,43202,240,512