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 18, 2022 18:43Victor MuñozVictor MuñozScore: 31,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 18, 2022 18:3830,677308,354,004254,618,81802,269,184
2Dec 18, 2022 18:3830,678325,185,155254,624,19302,269,184
3Dec 18, 2022 18:3830,680319,644,644254,646,98402,260,992
4Dec 18, 2022 18:4331,210347,350,913259,040,77302,269,184
5Dec 18, 2022 18:4331,213336,085,947259,064,20302,256,896
6Dec 18, 2022 18:4332,601339,300,103270,591,44202,273,280