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 12, 2023 17:27Dmitry MakarovDmitry MakarovScore: 92,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2023 17:2092,402837,745,431766,933,23002,289,664
2Jun 12, 2023 17:2792,402837,071,748766,935,08702,289,664
3Jun 12, 2023 17:2092,406834,940,504766,966,26802,277,376
4Jun 12, 2023 17:2792,422837,911,962767,106,10302,297,856
5Jun 12, 2023 17:2792,447853,628,401767,309,45802,297,856
6Jun 12, 2023 17:2092,470843,790,287767,500,88502,277,376