title: Fastest way to remove duplicates from a list of comparable, unhashable items
body: <p>How can I remove duplicate items from a list if all I know is that the list elements can be ordered?  (I also don't care about the order of items in the list.)</p>
  
  <p>Existing questions like <a href="https://stackoverflow.com/questions/479897/how-do-you-remove-duplicates-from-a-list-in-python-if-the-item-order-is-not-impo">How to remove duplicates from Python list and keep order?</a> or <a href="https://stackoverflow.com/questions/7961363/python-removing-duplicates-in-lists">Removing duplicates in lists</a> require the use of a set, i.e. require the items in the list to be hashable.
  <strong>In my case, hashability is not a guarantee.</strong></p>