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 4, 2022 20:17Franek KortaFranek KortaScore: 79,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2022 20:1778,34350,732,14726,988,0001,999,0002,281,472
2Aug 4, 2022 20:1778,41455,608,21626,012,0003,001,0002,281,472
3Aug 4, 2022 20:1778,54155,156,25526,054,0003,006,0002,281,472
4Aug 4, 2022 20:1778,79255,684,84528,148,0001,005,0002,281,472
5Aug 4, 2022 20:1778,88653,629,55426,169,0003,019,0002,269,184
6Aug 4, 2022 20:1778,92754,200,15926,182,0003,021,0002,281,472
7Aug 4, 2022 20:1779,74158,981,68728,487,0001,017,0002,281,472
8Aug 4, 2022 20:1780,16857,438,34428,640,0001,022,0002,285,568
9Aug 4, 2022 20:1780,82252,814,88926,914,0002,990,0002,375,680
10Aug 4, 2022 20:1782,274114,951,05030,441,35402,260,992
11Aug 4, 2022 20:1782,913101,268,07030,677,68502,260,992
12Aug 4, 2022 20:1785,71091,872,52431,712,77202,252,800