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 2, 2021 19:00evgenikwtevgenikwtScore: 52,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2021 19:0051,990520,796,242431,514,29602,273,280
2Jun 2, 2021 19:0051,994493,402,173431,547,47802,269,184
3Jun 2, 2021 19:0052,001497,929,681431,610,81202,269,184
4Jun 2, 2021 19:0052,002499,134,961431,620,40202,265,088
5Jun 2, 2021 19:0052,057484,074,600432,074,34302,269,184
6Jun 2, 2021 19:0052,080500,881,913432,266,56902,265,088