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 16:48Franek KortaFranek KortaScore: 72,773Success
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 16:4870,05146,737,32424,923,000996,0002,265,088
2Apr 9, 2023 16:4870,60050,378,14225,118,0001,004,0002,269,184
3Apr 9, 2023 16:4871,00349,333,39525,261,0001,010,0002,531,328
4Apr 9, 2023 16:4872,05951,577,91525,637,0001,025,0002,441,216
5Apr 9, 2023 16:4872,51952,388,65625,839,000993,0002,445,312
6Apr 9, 2023 16:4872,58950,676,41225,864,000994,0002,437,120
7Apr 9, 2023 16:4872,77354,919,66624,855,0002,071,0002,531,328
8Apr 9, 2023 16:4872,90350,995,79424,976,0001,998,0002,437,120
9Apr 9, 2023 16:4874,55454,220,37727,585,00002,441,216
10Apr 9, 2023 16:4877,01888,721,38628,496,83702,293,760
11Apr 9, 2023 16:4878,583105,405,69429,075,85102,289,664
12Apr 9, 2023 16:4880,90792,383,79629,935,65402,297,856