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 18:05Yuriy LyfenkoYuriy LyfenkoScore: 61,503Success
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 18:0561,065551,999,07121,567,0001,027,0002,289,664
2Sep 15, 2021 18:0561,114551,998,59721,585,0001,027,0002,285,568
3Sep 15, 2021 18:0561,124553,584,73921,588,0001,028,0002,285,568
4Sep 15, 2021 18:0561,192556,123,82220,673,0001,968,0002,281,472
5Sep 15, 2021 18:0561,400554,132,06120,743,0001,975,0002,281,472
6Sep 15, 2021 18:0561,449549,864,77520,759,0001,977,0002,285,568
7Sep 15, 2021 18:0561,503550,946,26521,767,000989,0002,277,376
8Sep 15, 2021 18:0561,522551,223,87621,774,000989,0002,277,376
9Sep 15, 2021 18:0561,554548,202,99222,775,00002,281,472
10Sep 15, 2021 18:0564,200586,268,41823,754,15202,252,800
11Sep 15, 2021 18:0564,258592,737,45323,775,31502,252,800
12Sep 15, 2021 18:0564,424578,863,35623,836,86102,269,184