I was recently working on this.
$k=1^1\times 2^2\times 3^3\times \cdots \times100^{100} = $$\frac{(100!)^{100}}{1!\cdot2!\cdot3!....\cdot99!}$$ $
Now calculate trailing zeroes in the factorials... using the de Poliganc's formula (No need to count fives): Derive a formula to find the number of trailing zeroes in $n!$
Use the formulae there & then customize it according to tailor it to this problem to solve it.
Edit: Alternative is:-
Number of fives in the expression involves counting number of fives from all the multiples of five.
Easiest trick=> $5^5\times 10^{10}\times 15^{15}\times \cdots\times 100^{100}$
Number of fives = Sum of all the terms of the powers of the above expression! Therefore, sum would be $5+10+15....+100$ This is easily solvable using arithmetic progression sum formula.
$100 = 5 +(n-1)5$ => $n = 20 $
Sum = $\frac{n(2a+(n-1)d)}{2}=\frac{20(2*5+(20-1)5)}{2}= 1050 $
$25^{25}=5^{50},\\ 50^{50}=5^{100}\cdot2^{50}\\ 75^{75}=5^{150}\cdot3^{75}\\ 100^{100}=5^{200}\cdot4^{100}\\$
Therefore number of zeroes, will be $1050+\frac{50+100+150+200}{2} = 1300$ Zeroes.