Earlier today,
Google posted the following on Twitter
I'm 01100110 01100101 01100101 01101100 01101001 01101110 01100111 00100000 01101100 01110101 01100011 01101011 01111001 00001010
This looks suspiciously like ASCII, so I set out to render it in a more human readable form:
Bin Hex ASCII
0110 0110 66 f
0110 0101 65 e
0110 0101 65 e
0110 1100 6C l
0110 1001 69 i
0110 1110 6E n
0110 0111 67 g
0010 0000 20 (space)
0110 1100 6C l
0111 0101 75 u
0110 0011 63 c
0110 1011 6B k
0111 1001 79 y
0000 1010 0A \n
I doubt I'm the first to post this, but there you have it :-)
3 comments:
I gotta learn how to read those..
Thanks! :D
Reading binary does occasionally come in handy. I find it is pretty easy to memorize the 4-bit sequences that give you digits 0-F and from there, lookup in an ASCII table is easy.
Har ye go, those who dunno:
>> print trim/with {01100110 01100101 01100101 01101100 01101001 01101110 01100111 00100000 01101100 01110101 01100011 01101011 01111001 00001010} { }
0110011001100101011001010110110001101001011011100110011100100000011011000111010101100011011010110111100100001010
>> print to-string 2#{0110011001100101011001010110110001101001011011100110011100100000011011000111010101100011011010110111100100001010}
feeling lucky
Post a Comment