Two sets $A$ and $B$ are said to have the same cardinality if there is a function $f: A \to B$ which is one-to-one and onto. More informally, $A$ and $B$ have the same cardinality if the elements of $A$ and $B$ can be "paired off."
Note that if $A$ is finite, then $A$ and $B$ have the same cardinality if and only if $A$ and $B$ have the same number of elements. But the formal definition of "same cardinality" does not mention numbers, so it makes sense even for infinite sets.
Let's look at an infinite example. The set $A=\{1,2,3,4,\dots\}$ of positive integers and the set $B=\{2,4,6,8,\dots\}$ of even positive integers have the same cardinality, for we can pair off the integer $k$ with the even integer $2k$. In terms of functions, the function $f(x)=2x$ is a one-to-one onto mapping from $A$ to $B$.
We say that $A$ has cardinality less than (the cardinality of) $B$ if there is a one-to-one mapping from $A$ to (part of) $B$, but $A$ and $B$ do not have the same cardinality.
Using the Axiom of Choice, one can prove that for any two sets $A$ and $B$, either (i) $A$ and $B$ have the same cardinality or (ii) $A$ has cardinality less than $B$ or (iii) $B$ has cardinality less than $A$. (This result is sometimes called Trichotomy.)
In this way, any two sets can be compared as to "size."
It turns out that not all infinite sets have the same cardinality. The famous early result is due to Cantor. Let $\mathbb{N}$ be the set of positive integers, and let $\mathbb{R}$ be the set of reals. Then $\mathbb{N}$ has cardinality less than $\mathbb{R}$. So, in the sense of cardinality, two infinite sets can have different sizes.
In general, the collection of all subsets of a set $S$ can be proved to have cardinality greater than the cardinality of $S$. In particular, this means that the collection of all subsets of the reals has cardinality greater than the set of reals.
In the sense of cardinality, there is a very rich family of different-sized "infinities."