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 3, 2023 22:11Franek KortaFranek KortaScore: 73,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 22:1173,30550,824,41026,119,0001,004,0002,445,312
2Apr 3, 2023 22:1173,43251,530,12926,164,0001,006,0002,437,120
3Apr 3, 2023 22:1173,50551,606,10125,183,0002,014,0002,269,184
4Apr 3, 2023 22:1173,62448,960,81025,224,0002,017,0002,437,120
5Apr 3, 2023 22:1173,65447,994,53025,234,0002,018,0002,433,024
6Apr 3, 2023 22:1173,67353,229,88325,240,0002,019,0002,527,232
7Apr 3, 2023 22:1173,77848,803,17826,287,0001,011,0002,441,216
8Apr 3, 2023 22:1173,79551,586,42227,304,00002,441,216
9Apr 3, 2023 22:1173,80849,775,04626,298,0001,011,0002,441,216
10Apr 3, 2023 22:1175,13884,425,57927,801,13402,174,976
11Apr 3, 2023 22:1175,56598,190,13227,959,18202,281,472
12Apr 3, 2023 22:1175,899115,321,51628,082,73002,289,664