Time complexity of a brute-force embedded MD5sum

Question

A question I've been meaning to have answered for a long time - What would be the time complexity of finding an MD5sum of a compiled binary that contains that same MD5 statically embedded in it, say, as a string?

Edit: If this wasn't already clear. I am looking for an answer with the time complexity and an explanation of it.

Answer 1

This can be solved in constant time.

The file that contains all possible MD5 digests contains the digest of that file.