title: Does md5 have any uniqueness guarantee for short strings (finite number of strings)?
body: <p>So I understand that there is proof that MD5 can not guarantee uniqueness as there are more strings in the universe than there are MD5 hash strings, but is there any inverse proof for a finite number of strings?</p>
  <p><strong>Basically, if I have strings of maximum length of X, is there an X for which MD5 is guaranteed to be unique? if yes, then what is that X? and if there are more than one values for X, what is the maximum value of X?</strong></p>
  <p>or is there such an X for any other hashing algorithm, SHA-1, etc.?</p>