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 listAug 2, 2022 13:01Yuriy LyfenkoYuriy LyfenkoScore: 61,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 13:0161,524546,662,12820,785,0001,979,0002,285,568
2Aug 2, 2022 13:0161,541554,820,29521,780,000990,0002,281,472
3Aug 2, 2022 13:0161,557548,385,53220,796,0001,980,0002,531,328
4Aug 2, 2022 13:0161,562556,148,69921,788,000990,0002,289,664
5Aug 2, 2022 13:0161,616550,916,90322,798,00002,281,472
6Aug 2, 2022 13:0161,668547,959,46220,833,0001,984,0002,289,664
7Aug 2, 2022 13:0161,708546,023,36721,840,000992,0002,371,584
8Aug 2, 2022 13:0161,727545,611,58820,853,0001,986,0002,269,184
9Aug 2, 2022 13:0161,776546,127,69020,870,0001,987,0002,281,472
10Aug 2, 2022 13:0164,032595,619,14723,691,71302,265,088
11Aug 2, 2022 13:0164,211588,270,27023,757,91202,248,704
12Aug 2, 2022 13:0164,395580,559,60023,826,24902,260,992