The answer is $256$.
We can reach the final state with all possible strings of length three on set $\{0,1\}.$
So there are $8$ ways to reach the final state and we will have a five-length string remaining where we have two options – either $0$ or $1,$ for each of the $5$ positions.
So, total number of strings accepted will be $8 \times 2^5 = 2^8 = 256.$