Answer: Binary Secret #338

The secret message is:

Try again

Row by row

Row	Bulbs	Add the ‘on’ numbers	Character
1	01010100	64 + 16 + 4 = 84	T
2	01110010	64 + 32 + 16 + 2 = 114	r
3	01111001	64 + 32 + 16 + 8 + 1 = 121	y
4	00100000	32 = 32	a space
5	01100001	64 + 32 + 1 = 97	a
6	01100111	64 + 32 + 4 + 2 + 1 = 103	g
7	01100001	64 + 32 + 1 = 97	a
8	01101001	64 + 32 + 8 + 1 = 105	i
9	01101110	64 + 32 + 8 + 4 + 2 = 110	n

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 chr() turns the number into its character.

secret = [
    "01010100",
    "01110010",
    "01111001",
    "00100000",
    "01100001",
    "01100111",
    "01100001",
    "01101001",
    "01101110",
]
message = ""
for code in secret:
    number = int(code, 2)
    message = message + chr(number)
print(message)

When you run it, it prints:

Try again