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, 2021 05:05evgenikwtevgenikwtScore: 29,060Success
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, 2021 05:0528,867303,233,045239,592,94502,256,896
2Jun 12, 2021 05:0528,899309,372,549239,859,99302,260,992
3Jun 12, 2021 05:0528,944308,086,379240,235,55302,248,704
4Jun 12, 2021 05:0529,001272,599,500239,713,000998,0002,260,992
5Jun 12, 2021 05:0529,041269,457,192239,040,0002,000,0002,379,776
6Jun 12, 2021 05:0529,056262,662,920240,168,0001,000,0002,519,040
7Jun 12, 2021 05:0529,060261,591,164240,196,0001,000,0002,371,584
8Jun 12, 2021 05:0529,072268,914,274240,296,0001,001,0002,260,992
9Jun 12, 2021 05:0529,091266,846,027240,455,0001,001,0002,256,896
10Jun 12, 2021 05:0529,118266,757,122239,686,0001,997,0002,519,040
11Jun 12, 2021 05:0529,119274,605,949239,690,0001,997,0002,519,040
12Jun 12, 2021 05:0529,120270,184,657239,703,0001,997,0002,260,992