Managing unsigned long long via hashtable

Asked Apr 19 '20 at 19:10

Active Apr 19 '20 at 19:10

Viewed 63 times

I'm looking for a solution on how to manage (accumulate, search, sort) hundreds of thousands of unsigned long long. Basically, I need to collect a number of hits for each hash represented as unsigned long long, then sort the list and get the top 100. But it should be fast and memory-efficient.

I'm writing in ansi c for Linux. Is there any library that could help to implement that?

Thanks!

asked Apr 19 '20 at 19:10

Greg

1

Your requirements have nothing to do with a hash table, and in fact a hash table does not allow efficiently implementing them. – Konrad Rudolph Apr 19 '20 at 19:13
What would you recommend? – Greg Apr 20 '20 at 07:34

Managing unsigned long long via hashtable

0 Answers0