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 listJun 11, 2023 21:20sliceteamsliceteamScore: 32,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2023 21:1932,032325,649,502265,862,68702,269,184
2Jun 11, 2023 21:2032,033332,002,444265,870,16902,273,280
3Jun 11, 2023 21:1932,048338,775,186266,000,56402,273,280
4Jun 11, 2023 21:2032,053319,968,529266,038,43702,269,184
5Jun 11, 2023 21:2033,609348,341,727278,954,98402,269,184
6Jun 11, 2023 21:1933,631350,868,273279,137,66502,265,088