Brutus 18 digit number?

Question

C++ / C#

it is necessary to sort through the numbers from 1,000,000,000,000,001 to 999,999,999,999,999,999. Create md5 for each value. Further, md5 will compare all the resulting sums with the number specified in advance by md5. To create tables, no memory is enough. But what if the data is not written anywhere, but the loop is repeated until the value matches?
How long will the script process this amount of data? The function, as I understand it, is something like this: a number is created from it, an md5 number is created, then it is checked against the given one, if the number matches the script stops, if not, then the cycle repeats.

Answer 1

https://gist.github.com/epixoip/a83d38f412b4737e99...
8x Nvidia GTX 1080 gives ~200Gh/s
i.e. it will sort through your range in a couple of months (maybe slightly faster, since your input string is very small).

Answer 2

We take and implement brute according to rainbow tables, fun and not very long. Naturally parallelized by threads and by clusters.