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 22, 2021 15:43Yuriy LyfenkoYuriy LyfenkoScore: 17,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 15:4317,265168,656,257143,302,00002,387,968
2May 22, 2021 15:4317,272169,351,452143,355,00002,392,064
3May 22, 2021 15:4317,276174,521,610142,392,0001,002,0002,260,992
4May 22, 2021 15:4317,286168,536,705143,470,00002,260,992
5May 22, 2021 15:4317,365172,115,424143,132,0001,000,0002,396,160
6May 22, 2021 15:4317,441173,022,947142,766,0001,996,0002,260,992
7May 22, 2021 15:4317,443172,708,006142,780,0001,996,0002,260,992
8May 22, 2021 15:4317,507168,024,712144,305,0001,002,0002,387,968
9May 22, 2021 15:4317,517167,211,813145,392,00002,523,136
10May 22, 2021 15:4318,133210,090,363150,502,69902,269,184
11May 22, 2021 15:4318,157213,460,894150,699,66802,273,280
12May 22, 2021 15:4318,717210,888,371155,355,16202,265,088