If $[0,1]^{[0,1]}$ were metrizable, then compactness and sequential compactness would be equivalent. You know $[0,1]^{[0,1]}$ is compact by Tychonoff, so to prove $[0,1]^{[0,1]}$ is not metrizable, we just need to find a sequence from which you cannot extract a convergent subsequence.
Here is one example - for each $n\in\mathbb{N}$ and $x\in[0,1]$, let $f_n(x)$ be the $n$-th digit in the binary expansion of $x$. If you look at the graphs of these $f_n$, they alternate between $0$ and $1$ with increasing frequency (copy and paste \operatorname{floor}\left(\operatorname{mod}\left(x,2\right)\right) into desmos graphing calculator to get an idea). Maybe you can come up with an argument as to why you cannot extract a convergent subsequence from $(f_n)$.
Alternatively, you can also show that $[0,1]^{[0,1]}$ is not first-countable (and therefore not second-countable), which may be easier. With this approach, just keep in mind that the intersection of countably many uncountable co-finite sets is, well, at least non-empty.