@wyatt Now I'm intrigued. Does your university's data structures class cover implementing a hash table from scratch? Say one that maps either fixed-length or zero-terminated character strings to 32-bit integers. I ask because one thing that the ISO C standard library lacks is any sort of map, dictionary, or associative array data structure. It's not like a dynamic array, where a thin wrapper around realloc() is adequate. (hsearch() is non-ISO and allows only one hash table per process.)