This looks like an esoteric language (like Ook) but it's not.
N.B.: According to 1, 2 and 3, kek is derivated of lel that is a derivated of lol, and topkek is a cake trademark popular on /s4s chan of 4Chan because of its similarity with toplel which means super funny. (Knowing that is useless for the challenge).
There is only two keyword TOP and KEK and they seem pretty useless. So let's assume that it is binary: (TOP = 0 && KEK = 1) or (TOP = 1 && KEK = 0).
We noticed there is between 1 and 5 exclamation marks following each keywords so let's assume that is the number of times that 0 or 1 is repeated.
# read the file file = File.open('kek.txt', 'r+t') data = file.read file.close puts "Original: \n" + data + "\n\n"
# Assume that TOP = 1, KEK = 0, and ! the number of time they appear topkek_to_binary = "" data.split(" ").each do|bool| if bool.match(/TOP/) marks = bool.sub('TOP', '') # keeping only the marks bin = marks.gsub('!', '1') # replacing marks with 0 topkek_to_binary.concat(bin) elsif bool.match(/KEK/) marks = bool.sub('KEK', '') # keeping only the marks bin = marks.gsub('!', '0') # replacing marks with 0 topkek_to_binary.concat(bin) end end puts "Binary: \n" + topkek_to_binary + "\n\n"
# Let's convert it into ASCII puts "ASCII: \n" + [topkek_to_binary].pack("B*")