The comments and answer here seem to be a little depressing - topology can still measure interesting properties of open sets! Michael Burr is probably right in that you can't hope for anything more than a poset, but let's at least construct an interesting one!
Let's try the following: $$\text{Define }\;A \le B\text{ if there is an embedding }\;A \stackrel{f}\hookrightarrow B.$$
We can check that this gives us a partial ordering on topological spaces, hence also topological subspaces. In addition, if $A \subset B$ are subspaces of $X$ then $A \le B$. (Note that if $A \le B$ it may not be the case that $A \subset B$.)
This is a purely topological characterization, and it turns out to be interesting, because we can use topological tools to study it!
One immediate question that you might have is, "Can you produce two spaces $X, Y$ such that $X \lneq Y$?" It turns out this is pretty easy: take $X = \mathbb R^2$, and take $Y = \mathbb{RP}^2$. Or if we want spaces that are incomparable elements consider $\mathbb{RP}^2$ and $S^2$. All these results rely on interesting algebraic topology.
So it seems this is an interesting way to characterize "size" in terms of topological complexity.
A few fun exercises for interested readers, in roughly increasing order of difficulty:
- Given a space $X$, what subspace(s) is/are minimal in this order? What set is a maximal element?
- Construct a space $X$ and subsets $A_i \subset X$ such that $$A_1 \lneq A_2 \lneq \cdots \lneq X.$$
- Give a version of the previous construction where $X$ and the $A_i$ are all connected.
- Prove that $\mathbb{RP}^2$ and $S^2$ are incomparable elements.
- Prove that $\mathbb{R}^2 \lneq \mathbb{RP}^2$.
- Construct a topological space $X$ and subspaces $\{A_r\}_{r \in \mathbb{R}_{\ge 0}}$ with $|X| = \mathfrak{c}$ (the cardinality of the continuum) and $A_r \lneq A_{r'}$ for all $r < r'$. (I'm not 100% sure my answer here is correct, or that this is possible.)