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 listMay 14, 2023 20:49sliceteamsliceteamScore: 92,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2023 20:5291,992839,555,140763,532,48802,277,376
2May 14, 2023 20:4991,993829,862,258763,544,70602,265,088
3May 14, 2023 20:5292,018833,571,793763,745,81802,269,184
4May 14, 2023 20:4992,023847,518,099763,786,91702,277,376
5May 14, 2023 20:4992,030832,460,537763,852,46902,265,088
6May 14, 2023 20:5292,031832,282,623763,853,36002,269,184