• This will be either the hardest test or easiest test you will ever take on OkCupid.

    Why will it be the hardest? All the test questions will be presented as binary representations of ASCII letters.

    Why will it be the easiest? Because, each question tells you EXACTLY which answer to pick.

    If you wish to, you can test any parser/program against the following before you begin: The following below should read out to you as "The quick red fox jumped over the lazy brown dog!"


    01010100 01101000 01100101 00100000 01110001 01110101 01101001 01100011 01101011 00100000 01110010 01100101 01100100 00100000 01100110 01101111 01111000 00100000 01101010 01110101 01101101 01110000 01100101 01100100 00100000 01101111 01110110 01100101 01110010 00100000 01110100 01101000 01100101 00100000 01101100 01100001 01111010 01111001 00100000 01100010 01110010 01101111 01110111 01101110 00100000 01100100 01101111 01100111 00100001 00100000 00001010

    11/13/07 This is also a test on how resourceful you can be. I won't tell you where, but a properly phrased Google search can yield results that may help you in this test.