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 6, 2022 18:33Franek KortaFranek KortaScore: 77,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 18:3377,33554,919,59826,571,0002,043,0002,523,136
2Aug 6, 2022 18:3377,41954,817,52825,576,0003,069,0002,285,568
3Aug 6, 2022 18:3377,45959,822,61227,637,0001,023,0002,281,472
4Aug 6, 2022 18:3377,46855,253,50427,640,0001,023,0002,359,296
5Aug 6, 2022 18:3377,50554,610,26027,653,0001,024,0002,281,472
6Aug 6, 2022 18:3377,51655,825,60428,681,00002,281,472
7Aug 6, 2022 18:3377,51654,180,70928,681,00002,281,472
8Aug 6, 2022 18:3377,94656,970,49625,857,0002,983,0002,527,232
9Aug 6, 2022 18:3377,98953,451,53227,861,000995,0002,531,328
10Aug 6, 2022 18:3382,51395,323,74430,529,96702,265,088
11Aug 6, 2022 18:3382,52399,791,29330,533,35702,260,992
12Aug 6, 2022 18:3382,531107,843,13630,536,58002,277,376