Can someone recommend a good hash function for OSC addresses

Question

A lot of OSC addresses are similar, often same prefixes, etc so it’s unclear that a general purpose string hash function that assumes random strings is the right way to go. In particular, OSC messages happen in real time, there can be many of them (thousands per second) so efficient calculation is really important. There’s no way to know in advance how many distinct addresses will be needed but typically there wouldn’t ever be more than a few hundred distinct names.