User blog comment:IIEnDeRwITHeRII/Node Function/@comment-30574991-20180513013150/@comment-30869823-20180513094514

You can count the amount of tries it takes for them to all mathup instead or realing on CPU speed (and use a seed for your randomness)

The chance \( n+1 \) random values with \( p \) possibilities matchup is \( 1\text{ in } p^n \) so the average amount of tries is \( p^n \) so \( n(n)\approx (10^8)^n=10^{8n} \)

So the function doens't grow that fast at all.