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 21:07Franek KortaFranek KortaScore: 75,819Success
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 21:0775,23252,711,08126,842,000994,0002,473,984
2Aug 14, 2022 21:0775,28653,922,89325,867,0001,989,0002,342,912
3Aug 14, 2022 21:0775,30353,852,26724,877,0002,985,0002,486,272
4Aug 14, 2022 21:0775,33254,645,19024,887,0002,986,0002,375,680
5Aug 14, 2022 21:0775,41456,830,46326,907,000996,0002,322,432
6Aug 14, 2022 21:0775,41458,067,28723,917,0003,986,0002,326,528
7Aug 14, 2022 21:0775,81952,660,62527,052,0001,001,0002,326,528
8Aug 14, 2022 21:0775,85151,573,30626,061,0002,004,0002,461,696
9Aug 14, 2022 21:0776,17053,231,49226,170,0002,013,0002,301,952
10Aug 14, 2022 21:0779,25694,466,63729,324,65802,191,360
11Aug 14, 2022 21:0779,30289,638,70729,341,57502,207,744
12Aug 14, 2022 21:0779,44093,468,34929,392,72502,310,144