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 listMay 14, 2021 19:47Yuriy LyfenkoYuriy LyfenkoScore: 18,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2021 19:4717,924177,094,373146,774,0001,996,0002,510,848
2May 14, 2021 19:4717,928178,176,760147,801,000998,0002,523,136
3May 14, 2021 19:4718,045174,793,369147,776,0001,996,0002,392,064
4May 14, 2021 19:4718,045176,788,444146,777,0002,995,0002,260,992
5May 14, 2021 19:4718,046175,906,855149,779,00002,387,968
6May 14, 2021 19:4718,050178,054,591147,821,0001,997,0002,260,992
7May 14, 2021 19:4718,052178,577,053148,836,000998,0002,387,968
8May 14, 2021 19:4718,065180,822,330148,938,000999,0002,260,992
9May 14, 2021 19:4718,067178,225,537146,957,0002,999,0002,387,968