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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:5972,05751,581,65424,611,0002,050,0002,449,408
2Apr 3, 2023 21:5972,12751,159,75926,687,00002,527,232
3Apr 3, 2023 21:5972,14951,969,41025,669,0001,026,0002,449,408
4Apr 3, 2023 21:5972,18153,930,33825,718,000989,0002,269,184
5Apr 3, 2023 21:5972,51954,317,43124,845,0001,987,0002,269,184
6Apr 3, 2023 21:5972,53855,745,05425,845,000994,0002,453,504
7Apr 3, 2023 21:5972,54951,515,41626,843,00002,449,408
8Apr 3, 2023 21:5972,57059,213,65525,857,000994,0002,527,232
9Apr 3, 2023 21:5972,58455,618,74126,856,00002,441,216
10Apr 3, 2023 21:5975,088102,156,62627,782,62202,297,856
11Apr 3, 2023 21:5975,66883,769,49527,997,03302,174,976
12Apr 3, 2023 21:5976,13479,643,40228,169,62002,289,664