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 14, 2022 19:44Franek KortaFranek KortaScore: 77,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2022 19:4477,07056,507,49527,498,0001,018,0002,342,912
2Aug 14, 2022 19:4477,16552,529,94026,512,0002,039,0002,351,104
3Aug 14, 2022 19:4477,19756,177,48927,543,0001,020,0002,359,296
4Aug 14, 2022 19:4477,21658,470,52028,570,00002,322,432
5Aug 14, 2022 19:4477,29254,314,69127,577,0001,021,0002,342,912
6Aug 14, 2022 19:4477,44167,236,34127,630,0001,023,0002,306,048
7Aug 14, 2022 19:4477,45455,359,87127,635,0001,023,0002,326,528
8Aug 14, 2022 19:4477,45759,815,46925,589,0003,070,0002,301,952
9Aug 14, 2022 19:4477,87654,483,15826,827,0001,987,0002,400,256
10Aug 14, 2022 19:4481,49098,073,23430,151,22502,306,048
11Aug 14, 2022 19:4482,132111,193,78930,388,88402,285,568
12Aug 14, 2022 19:4482,656102,843,11530,582,58102,277,376