So if a problem is more difficult the language it represents is smaller?
$L_1$ and $L_2$ are always countably infinite, and thus "equally big".

If any language is finite, then it is "constant time" recognizable.