just a note:
keyspace is: number_of_chars_in_charset ^ password_length (where ^ means "to the power of")
[0-9] = 10 digits to the power of (length) 16 (position 1 and 2 are fixed, you can check for 0.0000000000000000 and 1.0000000000000000 separately): 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 = 10,000,000,000,000,000
( this assumes all candidates are exactly of length 2 + 16 = 18)
quite a big number, isn't it?
feasible ? not really
keyspace is: number_of_chars_in_charset ^ password_length (where ^ means "to the power of")
[0-9] = 10 digits to the power of (length) 16 (position 1 and 2 are fixed, you can check for 0.0000000000000000 and 1.0000000000000000 separately): 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 = 10,000,000,000,000,000
( this assumes all candidates are exactly of length 2 + 16 = 18)
quite a big number, isn't it?
feasible ? not really