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 listFeb 13, 2024 11:09AlexanderAlexanderScore: 153,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2023 07:27153,0451,342,275,7411,270,273,11802,269,184
2Jun 28, 2023 07:27153,0491,338,159,3831,270,306,45802,269,184
3Feb 13, 2024 11:09153,0591,352,708,1071,270,388,68502,265,088
4Jun 28, 2023 07:27153,1101,332,943,9141,270,812,73502,265,088
5Feb 13, 2024 11:09153,1241,344,047,1341,270,930,26202,260,992
6Feb 13, 2024 11:09153,4241,328,977,9841,273,419,21402,260,992