If space is really too much of an issue to have an array of every value in the range, but you need more speed than a simplistic solution like my previous post will give you,
than you could store the sorted list of keys from your hash and binary search it. This is probably the best compromise if you have major speed and memory concerns.
Of course, this all depends on what the data is like, and how it is used. A simpler solution will almost certainly suffice, unless you are accessing megabytes of data thousands of times.