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 28, 2023 20:44Franek KortaFranek KortaScore: 75,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 20:4474,91453,509,85927,718,00002,441,216
2Aug 28, 2023 20:4475,25158,282,16724,860,0002,983,0002,531,328
3Aug 28, 2023 20:4475,30057,956,95027,861,00002,531,328
4Aug 28, 2023 20:4475,34353,791,54024,891,0002,986,0002,535,424
5Aug 28, 2023 20:4475,51652,966,20925,946,0001,995,0002,437,120
6Aug 28, 2023 20:4475,60546,347,81725,976,0001,998,0002,441,216
7Aug 28, 2023 20:4475,86554,608,99226,065,0002,005,0002,445,312
8Aug 28, 2023 20:4475,88153,990,44127,074,0001,002,0002,269,184
9Aug 28, 2023 20:4475,89548,080,05227,079,0001,002,0002,265,088
10Aug 28, 2023 20:4479,291107,645,53329,337,65902,293,760
11Aug 28, 2023 20:4479,30896,270,72529,344,11202,285,568
12Aug 28, 2023 20:4479,85790,423,12029,547,23502,281,472