How can some of the programs solve this problem within 0.001 s?

Simply because this problem has nothing to do with iterations but with permutation and combination. How many different representation for the sample are there [0, 1] over 10 positions it is 2^10 = 1024 but you cannot have "0" at 1st position so 2^10 - 2^9 = 512 and like so you continue to subtract the permutations where you would have two successive zeros and at the end you should get 90.