Identifying a starting point for maximum coverage
It sounds like you want to select a set of 50 lists whose union contains as many elements as possible.  This is the maximum coverage problem, which is NP-complete, but there are standard techniques that can be used to get decent-quality solutions (there is an approximation algorithm using a greedy algorithm, and a formulation as ILP).