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 listSep 16, 2021 20:47Malik ShamsutdinovMalik ShamsutdinovScore: 105,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2021 20:47104,865936,711,847870,380,78402,220,032
2Sep 16, 2021 20:46104,893950,818,049870,608,45002,224,128
3Sep 16, 2021 20:46104,984945,800,345871,365,35702,211,840
4Sep 16, 2021 20:46105,019934,481,962871,654,54202,228,224
5Sep 16, 2021 20:47105,066945,225,129872,049,19102,215,936
6Sep 16, 2021 20:47105,109939,640,085872,406,51402,211,840