Is there a total ordering on $\mathcal P(\Bbb R)$, the set of all subsets of $\Bbb R$, such that the set of countable subsets is dense in it?
(Given a total ordering $(X,>)$, a set $A\subseteq X$ is dense in $X$, if, for any two distinct $x,y\in X$, there is an $a\in A$ such that $x<a<y$.)
I think that I could make something work if I use the well-ordering theorem on $\Bbb R$, but I have no idea how to do it without the axiom of choice. I don't even know if any total ordering on $\mathcal P(\Bbb R)$ exists without choice.