# Fast way to count distinct pairs of integers

I have a association list, S, whose size is about 5*10^4. I also have a function F which takes in ordered pairs of elements from S, and spits out ordered pairs of integers. There is some amount of repetition among these outputs of F.

I'd like to compute the exact cardinality of the image of F, if that's possible.

Edited to add: By modifying the function F, we might as well assume that S is just Range[1,2.5*10^9], and that F outputs a single 20 digit integer for each input. Computing F[S] is highly memory intensive. I was thinking that perhaps one way to handle this would be to print the outputs, according to their modulus, mod 1000, to different files, and then compute the number of distinct outputs in each file, separately. Are there fast ways to do that?

• can you post F and a small part of S ? – kglr Oct 5 at 1:18
• CountDistinctBy[F][S]? – kglr Oct 5 at 6:20
• One can take S to be Range[1,5*10^4]. For the purposes of my computation, we can take F[i_,j_]:=i*j. – Pace Nielsen Oct 7 at 14:36

You can use CountDistinctBy:
CountDistinctBy[F][S]

• @PaceNielsen, maybe (for the example function F) Length[Union @@ ParallelTable[i j, {i, 10000}, {j, 1, i}]] or Length[DeleteDuplicates[Join @@ ParallelTable[i j, {i, 10000}, {j, 1, i}]]]? – kglr Oct 8 at 19:28