Well in that case the cost of a hash-function is also not O(1) since the minimum length of a n distinct keys is log(n).

Really both a trie and a hash-function boil down to O(m) where m is the length of the key.