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 6, 2021 21:42Yuriy LyfenkoYuriy LyfenkoScore: 17,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2021 21:4217,503666,747,539144,273,0001,001,0002,523,136
2Jun 6, 2021 21:4217,506668,768,547144,296,0001,002,0002,260,992
3Jun 6, 2021 21:4217,509668,500,853144,326,0001,002,0002,400,256
4Jun 6, 2021 21:4217,512666,656,988145,347,00002,260,992
5Jun 6, 2021 21:4217,515676,063,944144,376,0001,002,0002,260,992
6Jun 6, 2021 21:4217,522676,003,116144,436,000996,0002,523,136
7Jun 6, 2021 21:4217,527671,870,195143,480,0001,992,0002,260,992
8Jun 6, 2021 21:4217,531671,645,973144,507,0001,003,0002,265,088
9Jun 6, 2021 21:4217,546675,709,352144,633,000997,0002,260,992
10Jun 6, 2021 21:4217,787713,346,139147,635,55902,260,992
11Jun 6, 2021 21:4217,788724,373,550147,641,66502,240,512
12Jun 6, 2021 21:4217,793715,003,618147,679,88902,265,088