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:16Franek KortaFranek KortaScore: 78,854Success
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:1676,41949,880,30325,246,0003,029,0002,281,472
2Aug 4, 2022 20:1677,34958,441,35527,597,0001,022,0002,269,184
3Aug 4, 2022 20:1677,99759,425,31023,884,0004,975,0002,281,472
4Aug 4, 2022 20:1678,25451,020,58226,958,0001,996,0002,281,472
5Aug 4, 2022 20:1678,75752,131,75627,131,0002,009,0002,281,472
6Aug 4, 2022 20:1678,81654,739,80726,146,0003,016,0002,281,472
7Aug 4, 2022 20:1678,85452,775,36928,170,0001,006,0002,281,472
8Aug 4, 2022 20:1679,68451,568,45629,483,00002,281,472
9Aug 4, 2022 20:1679,83551,475,12927,502,0002,037,0002,514,944
10Aug 4, 2022 20:1682,95495,002,68630,692,93202,256,896
11Aug 4, 2022 20:1684,07688,135,69631,108,18902,269,184
12Aug 4, 2022 20:1684,216105,648,77031,159,94402,256,896