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 5, 2022 21:26Franek KortaFranek KortaScore: 77,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2022 21:2676,25449,880,44326,199,0002,015,0002,285,568
2Aug 5, 2022 21:2676,58455,898,83126,312,0002,024,0002,285,568
3Aug 5, 2022 21:2676,68153,637,30527,359,0001,013,0002,285,568
4Aug 5, 2022 21:2676,92749,495,59227,447,0001,016,0002,527,232
5Aug 5, 2022 21:2676,97049,731,43328,479,00002,285,568
6Aug 5, 2022 21:2676,98155,827,56726,449,0002,034,0002,285,568
7Aug 5, 2022 21:2677,27056,267,08027,569,0001,021,0002,535,424
8Aug 5, 2022 21:2677,42257,531,01526,600,0002,046,0002,535,424
9Aug 5, 2022 21:2677,50557,961,97427,653,0001,024,0002,273,280
10Aug 5, 2022 21:2682,14484,880,89330,393,12002,273,280
11Aug 5, 2022 21:2683,09576,290,09830,745,09202,277,376
12Aug 5, 2022 21:2683,803108,714,34931,006,95902,273,280