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 13, 2021 22:36evgenikwtevgenikwtScore: 28,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 22:3627,528288,861,669228,483,07602,252,800
2Jun 13, 2021 22:3627,530289,682,632228,500,78702,252,800
3Jun 13, 2021 22:3627,944309,241,307231,932,85902,252,800
4Jun 13, 2021 22:3628,005256,147,498232,445,00002,367,488
5Jun 13, 2021 22:3628,035259,033,107230,697,0001,997,0002,519,040
6Jun 13, 2021 22:3628,038258,179,483230,720,0001,997,0002,498,560
7Jun 13, 2021 22:3628,568261,708,516236,111,0001,000,0002,519,040
8Jun 13, 2021 22:3628,601259,224,709237,391,00002,260,992
9Jun 13, 2021 22:3628,611266,243,767237,473,00002,260,992
10Jun 13, 2021 22:3628,649266,708,437235,791,0001,998,0002,375,680
11Jun 13, 2021 22:3628,653267,414,281236,823,000999,0002,260,992
12Jun 13, 2021 22:3628,667264,163,626236,933,000999,0002,486,272