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 27, 2023 21:59Franek KortaFranek KortaScore: 72,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2023 21:5972,14651,726,73425,668,0001,026,0002,437,120
2Aug 27, 2023 21:5972,54651,558,77425,848,000994,0002,437,120
3Aug 27, 2023 21:5972,54654,585,58924,854,0001,988,0002,535,424
4Aug 27, 2023 21:5972,57351,442,95425,858,000994,0002,531,328
5Aug 27, 2023 21:5972,58155,856,10326,855,00002,265,088
6Aug 27, 2023 21:5972,65449,226,78224,815,0002,067,0002,441,216
7Aug 27, 2023 21:5972,88953,019,15623,973,0002,996,0002,527,232
8Aug 27, 2023 21:5972,88948,117,40325,971,000998,0002,265,088
9Aug 27, 2023 21:5972,91951,544,46825,981,000999,0002,437,120
10Aug 27, 2023 21:5981,44893,447,77930,135,84502,297,856
11Aug 27, 2023 21:5981,66599,825,13130,216,03702,289,664
12Aug 27, 2023 21:5982,326108,673,32130,460,71502,269,184