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:43Yuriy LyfenkoYuriy LyfenkoScore: 17,849Success
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:4317,777173,969,303147,552,00002,260,992
2May 14, 2021 19:4317,778173,317,721146,555,0001,003,0002,260,992
3May 14, 2021 19:4317,804178,928,266146,772,000998,0002,392,064
4May 14, 2021 19:4317,809175,975,449145,818,0001,997,0002,523,136
5May 14, 2021 19:4317,849175,899,816146,148,0002,002,0002,260,992
6May 14, 2021 19:4317,851173,979,458147,159,0001,001,0002,260,992
7May 14, 2021 19:4317,864173,249,292147,271,0001,001,0002,260,992
8May 14, 2021 19:4317,876171,910,852147,365,0001,002,0002,260,992
9May 14, 2021 19:4317,876172,060,932147,370,0001,002,0002,523,136