hacker.org

lamedog

If you can make it short make it efficient too, this is my long code:

* It doesn't use (abuse) the call stack
* It doesn't write on memory nor damaging the input data
* It uses at most 5 elements of the stack

Code: Select all

0<00^54*:2?3gdp!0^<0^3^:1:2?4g1v2vd1+058*-g

lamedog

My brute force solution takes like years to give the answers! my solution; (the real code is too long too ugly and too twisted): cipher = '9488818...' for each key in range(256, 256, 256, 256) is_good_key = True plain = "" for each triple_char in cipher plain += unscramble(triple_char, key...

lamedog

The Python console style

Code: Select all

raw="""
<PASTE THE TEXT HERE>
"""
# drop ponctuation
txt = raw.replace('.', ' ').replace(',', ' ')

# go get the word
list = txt.split()
word = [x for x in list if list.cont(x) == 1]

# here you are!!!
print(word)

hacker.org

Search found 3 matches

longer better faster stronger