It depends I think what kind of unique record list this is, how many elements it has etc. For example, you could use the TextDictionary system extension to maintain in parallel a dictionary for easy and efficient checking of duplicates.

It is a record list. And it'll have 0-100 elements.

And how often do you need to insert one, i.e. how often do you need to check for duplicates? And where are those records coming from?

The records are coming from different aggregates. Also, I don't really need to check for duplicates after every insert, I just need a unique list at the end.

The insert operation doesn't happen frequently as it is a small list. 

Imho make it simple with a for each check. If that is becoming too slow, refactor it.

Vinay,

The easiest way to ensure there are not duplicates is to check before adding. You can indeed follow up J's recommendation if it's infrequent and the list small, or when that becomes too slow, use TextDictionary to avoid duplicates.