Answer: Binary Secret #55

The secret message is:

GEM

Row by row

Row	Bulbs	Add the ‘on’ numbers	Character
1	00111	4 + 2 + 1 = 7	G
2	00101	4 + 1 = 5	E
3	01101	8 + 4 + 1 = 13	M

Crack it with Python

Python can do the adding for you. int(code, 2) reads a string of 1s and 0s as a binary number. Then the program finds that letter in the alphabet. It takes away 1 because Python counts the letters from 0.

secret = [
    "00111",
    "00101",
    "01101",
]
letters = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
message = ""
for code in secret:
    number = int(code, 2)
    message = message + letters[number - 1]
print(message)

When you run it, it prints:

GEM