For a given binary string with a length of 32bit, all possible combinations are 2^32. Assume we want to hash each value and put it in a hashmap. I wonder, is that possible in java?
what about memory overhead or other exceptions (from JVM point of view).