You're right but that's still in a very small subset of possible hashing functions because you must produce a 4 bytes hash, which is then hashed again (to the length of the storage array). Of course you don't have as requirement to avoid collision, just to distribute as equally as possible.
Using chosen hash functions in your applications isn't so rare even outside cryptography field. For example I often use hash for storage addressing (ala git). For this kind of thing you need something fast and with practically no collision (which isn't a requirement for a common hash table).
I'm surprised they're on HN but I have a (geeky) friend who do most of his work on an Android tablet so that his "computer" is always on and ready. That makes a difference when you run more than one time in more than on place and you spend a lot of time with your customers too.
I'm 40. My grandfather, when he was young, even if he did almost no programming, was a leader in the introduction of computing in press in US and later in France.
If you want to play, just play with the toy that looks the most fun. Don't plan for the best route, take the most interesting one. There will be enough occasions in your coding life to be serious and not be given a choice...