Please reason step by step, and put your final answer within \boxed{}.
On each of the 2013 cards, there is a unique number written. The cards are turned face down. In one move, you are allowed to point to ten cards, and you will be told one of the numbers written on them (it is not known which one).

What is the largest $t$ for which it is guaranteed to find $t$ cards, for which it is known what number is written on each of them?
user