Yes. Spearman rank correlation relieves you from the burden of knowing the marginal distribution of the number of users and sizes. It requires you to convert the number of users and project sizes into ranks first, so you will be get 2 million pairs of ranking orders as the input. Then the formula basically computes a "distance" between the two permutations determined by these ranking orders. You can then test the hypothesis that these two quantities are correlated through p-value calculation based on the null distribution, that is, the distribution of Spearman's rank correlation when one of the ranking is just 1,2,3,...,2million, and the other one is uniformly random. It converges to some Gaussian distribution as the size goes to infinity, which makes the calculation easy. These calculations and other related ranking distance functions can be found in this paper by Diaconis and Graham.