Chuck Norris wasn't developed code, code itself was developed for Chuck Norris...

• Python fixed in this fork
  (16 --> 80 out of 384 solutions invalidated)

• Ruby fixed in this fork
  (5 --> 14 out of 63 solutions invalidated)

• JavaScript edge cases added in this fork + edit due to assert.deepEqual failing to compare +0 & -0
  (0 --> 105 out of 493 solutions invalidated)

• Haskell edge cases added directly in the edit window
  (0 --> 5 out of 39 solutions invalidated)

@Just4FunCoder check the issue above, the reference solution doesn't handle tests like that one.

Testing for [0, 79] and 0:
[0, 79] should equal None,
but 0 * 79 == 0...

No issue with kata.

Description says: "Return [...] None if: [...] more than one number meet the conditions".

For your example, matching numbers can be 4, 8, 16, etc.

python: error on Fixed Tests 4:

right = ['The number is an even number', 'The number is divisible by 4']
wrong = ['The number is divisible by 3']
test.assert_equals(guess_number(right, wrong), None)

currect result: 4

I guess I misunderstood what @dfhwze was doing in the tests. It should be fixed now, I edited it directly into the kata.

I advise you to use completely random tests, otherwise you can solve this kata, for example, in the same way:

def press(k: int, n: int) -> list[int]:
    b = n.bit_length()
    return {
        (3, 3): [0, 1, 0],
        (3, 4): [1, 1, 0],
        (4, 3): [0, 0, 1, 0],
        (4, 4): [0, 1, 1, 0],
        (4, 6): [0, 1, 0, 1],
        (4, 7): [0, 1, 0, 0],
        (4, 8): [1, 1, 0, 0],
        (4, 9): [1, 1, 0, 1],
        (6, 26): [0, 1, 0, 1, 1, 1],
        (6, 41): [1, 1, 1, 1, 0, 1],
        (8, 53): [0, 0, 1, 0, 1, 1, 1, 1],
        (8, 168): [1, 1, 1, 1, 1, 1, 0, 0],
        (10, 1000): [1, 0, 0, 0, 0, 1, 1, 1, 0, 0],
    }.get((k, n), [0] * (k - b) + [1] * b)

but you had yourself also created a function...

No need for making it a function 💀

The symbol is called an asterisk btw.