Answer: Binary Secret #353

The secret message is:

Big smile

Row by row

Row	Bulbs	Add the ‘on’ numbers	Character
1	01000010	64 + 2 = 66	B
2	01101001	64 + 32 + 8 + 1 = 105	i
3	01100111	64 + 32 + 4 + 2 + 1 = 103	g
4	00100000	32 = 32	a space
5	01110011	64 + 32 + 16 + 2 + 1 = 115	s
6	01101101	64 + 32 + 8 + 4 + 1 = 109	m
7	01101001	64 + 32 + 8 + 1 = 105	i
8	01101100	64 + 32 + 8 + 4 = 108	l
9	01100101	64 + 32 + 4 + 1 = 101	e

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 = [
    "01000010",
    "01101001",
    "01100111",
    "00100000",
    "01110011",
    "01101101",
    "01101001",
    "01101100",
    "01100101",
]
message = ""
for code in secret:
    number = int(code, 2)
    message = message + chr(number)
print(message)

When you run it, it prints:

Big smile