As shown here, the set of the continuous real functions $(ℝ,ℝ)$ has the same cardinality as the set of the real numbers $ℝ$.
Considering that it is easy to define a well-behaved distance in the set $(ℝ,ℝ)$, the immediate question would be: can you construct a continuous mapping $Φ: ℝ → (ℝ,ℝ)$ that is also surjective?
Since all the functions would be continuous, they'd be completely determined by their restriction to the rational numbers $Φ: ℚ → (ℚ,ℝ)$; by playing around with pairs of countable indices, it is easy to approximate a given continuous function - I wonder if there is a diagonal argument that can be used to prove or disprove the existence of a continuous mapping that can approximate any continuous function.
First choice: given two continuous functions $f_j:ℝ→ℝ$ for j=1,2, rescale the codomain of the functions to obtain $f'j:ℝ→(-1,1)$ (e.g. by applying $x→sign(x)\frac{x^2}{1+x^2}$), define the distance as $\limsup{x \in ℝ}|f'_1(x) - f'_2(x)|$
Second choice: rescale the codomain of the functions, select a complete enumeration of the rational numbers $q:\mathbb{N}→\mathbb{Q}$, define the distance as $\sum_{n\in\mathbb{N}}\frac{|f'_1(q(n)) - f'_2(q(n))|}{2^n}$
– Gianluca Calcagni Oct 27 '21 at 10:52