) is the copy of Shakespeare's
complete works you've always wanted. Find the longest sequence of executable
x86 machine code which does not touch memory*, (and send us the MD5 of it)
You may assume that all registers are clear (0) on entry. Also, the sequence
may not jump out of the bards work.
The answer should be the text from the beginning instruction to the beginning
of the instruction that terminates the sequence ie:
In The String:
The solution would be
Because the executed instructions would be:
jz 0x29 (remember, all regs start as 0 including eflags)
Then the push ebx terminates the sequence because it touches the stack.
*A note on the "touch memory" constraint: None of the instructions may read or
write memory from ANY address during their execution.
This includes stack accesses (push/pop/stos) etc...