I read those things and I still don't quite get what you're after. The only thing Skel wrote was that the hash table had 20 000 buckets. I mean sure, usually you choose a better number than 20k, such as a prime or a power of 2 or something, but surely that can't be it? He specified nothing regarding the hash function, so that can't be it. Furthermore he didn't say how many elements would be stored in the array, so I can't see when the load factor comes into play.
Call me bad at hash tables and don't ever hire me or whatever, but this seems like a far fetched riddle. At least I don't get it.
Everything has an end, except for the sausage. It has two.