## solution
the simplest possible "oracle attack" challenge, the binary compares the flag to your input and will sleep for 1 second * the difference between the flag character and the input character. for each character you can binary search down to the correct character. I didn't bother writing a solver though I did some minor testing to ensure it behaves correctly.
The only twists on this challenge are that the sleep syscall was implemented by hand, and the syscall number is multiplied by argc (which will be 1) to make it so decompilers don't immediately recognize the syscall as nanosleep.