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 25, 2024 06:36Javid izadiJavid izadiScore: 79,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 06:3679,589682,716,587485,700,000174,891,0002,293,760
2Dec 25, 2024 06:3679,596686,055,196484,741,000175,906,0002,408,448
3Dec 25, 2024 06:3679,640690,472,002487,012,000174,004,0002,285,568
4Dec 25, 2024 06:3679,655689,198,558485,369,000175,771,0002,289,664
5Dec 25, 2024 06:3679,690689,995,375484,581,000176,847,0002,490,368
6Dec 25, 2024 06:3679,817693,715,857486,619,000175,862,0002,289,664
7Dec 25, 2024 06:3679,899688,191,001486,386,000176,777,0002,297,856
8Dec 25, 2024 06:3680,063690,977,631486,648,000177,871,0002,461,696
9Dec 25, 2024 06:3680,096693,345,732486,853,000177,946,0002,289,664