An efficient method for multiple searches of a large vector
I have a sorted vector vec
of 10 million 21-digit integers. A process generates around 10^12 21-digit integers (unordered) and I need to check which of them are in my vector. What algorithm would be reasonably time efficient for that?