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, 2021 05:07evgenikwtevgenikwtScore: 63,602Success
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, 2021 04:5763,399589,500,470526,212,46702,269,184
2Jun 11, 2021 04:5763,419592,326,062526,378,52902,265,088
3Jun 11, 2021 05:0763,500583,938,428527,046,66402,265,088
4Jun 11, 2021 05:0763,602588,959,705527,899,55602,273,280
5Jun 11, 2021 04:5763,624589,217,384528,079,24302,273,280
6Jun 11, 2021 05:0763,911591,367,531530,463,92802,269,184