If this is ASP.NET, then you can avail yourself of distinct with LINQ. If this is classic ASP, then you're talking about an algorithm 101 question. Will you always have 5 or so records? If so then the approach doesn't really matter. If not then you need to make some optimization decisions.
If your table structure is as rokslide is suggesting, then you "fix" this issue by using an actual relational model in the database.
Assuming you don't want to or can not fix your database... this script might help you...
duplicateStrings = Array("WU7TD","TYBSU","MAWVR","WU7TD","ASKRF")
for each entry in duplicateStrings
Response.Write(entry & " ")
matches = UBound(Filter(distinctStrings,entry))
distinctStrings(Ubound(distinctStrings)) = entry
Redim Preserve distinctStrings(UBound(distinctStrings)+1)
Redim Preserve distinctStrings(UBound(distinctStrings)-1)
for each dis_entry in distinctStrings
response.write("- " & dis_entry & "<br>")
Basically it looks though an array of strings, if the string is not in the distinct list (another array) it adds it to the distinct list.