TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listSep 15, 2021 17:57Yuriy LyfenkoYuriy LyfenkoScore: 61,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 17:5761,008553,118,84722,573,00002,281,472
2Sep 15, 2021 17:5761,051552,697,11521,563,0001,026,0002,281,472
3Sep 15, 2021 17:5761,070548,887,99521,569,0001,027,0002,281,472
4Sep 15, 2021 17:5761,086554,328,92721,575,0001,027,0002,289,664
5Sep 15, 2021 17:5761,368546,643,22720,732,0001,974,0002,519,040
6Sep 15, 2021 17:5761,478551,217,06221,758,000989,0002,281,472
7Sep 15, 2021 17:5761,486554,708,14521,761,000989,0002,281,472
8Sep 15, 2021 17:5761,524555,825,32120,785,0001,979,0002,289,664
9Sep 15, 2021 17:5761,559549,310,09521,787,000990,0002,289,664
10Sep 15, 2021 17:5764,214584,077,64423,759,02202,260,992
11Sep 15, 2021 17:5764,402588,194,44223,828,70702,252,800
12Sep 15, 2021 17:5764,739581,114,94123,953,39802,252,800