Is there a way to generate the hash of all the possible combination of a 10 digit number that starts with same 2 letters(DW) always.

So, ideally that would be computing the hash of all the following strings:

DW0000000001, DW0000000002, DW0000000003 ….. DW9999999999.

My question is around how to do it faster? Using loops takes forever.
Also, we can use MD5 or any other hash function.