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 listApr 9, 2023 19:54Franek KortaFranek KortaScore: 80,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 19:5476,72250,219,00128,387,00002,441,216
2Apr 9, 2023 19:5477,40352,933,74927,617,0001,022,0002,527,232
3Apr 9, 2023 19:5477,96852,599,52326,859,0001,989,0002,437,120
4Apr 9, 2023 19:5478,32760,760,37526,983,0001,998,0002,523,136
5Apr 9, 2023 19:5479,25450,723,89528,313,0001,011,0002,527,232
6Apr 9, 2023 19:5479,68455,254,68729,483,00002,441,216
7Apr 9, 2023 19:5480,15757,644,13129,658,00002,527,232
8Apr 9, 2023 19:5480,65158,801,10726,857,0002,984,0002,441,216
9Apr 9, 2023 19:5480,66554,902,00828,852,000994,0002,441,216
10Apr 9, 2023 19:5481,46794,617,71030,142,94002,293,760
11Apr 9, 2023 19:5481,481101,275,88230,147,93402,281,472
12Apr 9, 2023 19:5483,528108,759,38530,905,43102,293,760