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:57evgenikwtevgenikwtScore: 32,987Success
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 06:0232,101327,344,183266,439,09502,260,992
2Jun 11, 2021 06:0232,227331,020,634267,484,87202,281,472
3Jun 11, 2021 05:5732,237324,070,744267,567,45902,273,280
4Jun 11, 2021 06:0232,987337,776,477273,795,45902,273,280
5Jun 11, 2021 05:5733,162337,012,698275,248,69902,256,896
6Jun 11, 2021 05:5733,186344,250,829275,443,31202,256,896