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:48Franek KortaFranek KortaScore: 71,911Success
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:4871,41450,178,09225,407,0001,016,0002,445,312
2Apr 3, 2023 21:4871,43844,894,30725,416,0001,016,0002,269,184
3Apr 3, 2023 21:4871,61645,133,23823,441,0003,057,0002,441,216
4Apr 3, 2023 21:4871,62252,161,59926,500,00002,437,120
5Apr 3, 2023 21:4871,73052,675,76626,540,00002,437,120
6Apr 3, 2023 21:4871,78947,219,59726,562,00002,531,328
7Apr 3, 2023 21:4871,91151,565,27425,584,0001,023,0002,531,328
8Apr 3, 2023 21:4871,91648,942,54925,586,0001,023,0002,449,408
9Apr 3, 2023 21:4872,00051,387,39426,640,00002,527,232
10Apr 3, 2023 21:4875,90390,779,04528,084,01702,289,664
11Apr 3, 2023 21:4876,09596,692,00728,155,08402,289,664
12Apr 3, 2023 21:4876,17278,716,75928,183,47102,170,880