This is datastructures and algorithms 101.
A hashtable is guaranteed O(1) lookup.
A list is O(N).
While you might be able to find an item in a list quickly, as N grows, so does your worst case performance (e.g. you are looking for something that is at the end of the list). A hashtables speed...