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 17, 2021 20:18Yuriy LyfenkoYuriy LyfenkoScore: 17,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 20:1817,5252,935,021,356143,465,0001,992,0002,260,992
2May 17, 2021 20:1817,5332,110,433,335143,535,0001,993,0002,260,992
3May 17, 2021 20:1817,5502,294,799,321143,671,0001,995,0002,523,136
4May 17, 2021 20:1817,553570,238,998142,699,0002,993,0002,265,088
5May 17, 2021 20:1817,5532,693,377,474143,697,0001,995,0002,396,160
6May 17, 2021 20:1817,5541,440,062,703143,706,0001,995,0002,519,040
7May 17, 2021 20:1817,5552,715,974,584143,714,0001,996,0002,260,992
8May 17, 2021 20:1817,5561,131,072,854143,719,0001,996,0002,265,088
9May 17, 2021 20:1817,5572,406,511,188143,725,0001,996,0002,523,136