Answer: Binary Secret #10

The secret message is:

JAM

Row by row

Row	Bulbs	Add the ‘on’ numbers	Character
1	01010	8 + 2 = 10	J
2	00001	1 = 1	A
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 = [
    "01010",
    "00001",
    "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:

JAM