1 2 3 
2 3 1 
3 1 2

Do you see all numbers from 1 to 9 there?

No.

should_pass_all_tests
Log
5 6 1 8 4 7 9 2 3
3 7 9 5 2 1 6 8 4
4 2 8 9 6 3 1 7 5
6 1 3 7 8 9 5 4 2
7 9 4 6 5 2 3 1 8
8 5 2 1 3 4 7 9 6
9 3 5 4 7 8 2 6 1
1 4 6 2 9 5 8 3 7
2 8 7 3 1 6 4 5 9
//--
8 7 1 3 6 4 9 5 2
2 3 9 1 5 8 4 6 7
6 5 4 7 9 2 8 1 3
3 8 2 5 1 9 7 4 6
4 1 6 8 7 3 5 2 9
7 9 5 4 2 6 1 3 8
5 6 8 2 4 7 3 9 1
9 4 7 6 3 1 2 8 5
1 2 3 9 8 5 6 7 4
//--
1 2 3 4 5 6 7 8 9
2 3 1 5 6 4 8 9 7
3 1 2 6 4 5 9 7 8
4 5 6 7 8 9 1 2 3
5 6 4 8 9 7 2 3 1
6 4 5 9 7 8 3 1 2
7 8 9 1 2 3 4 5 6
8 9 7 2 3 1 5 6 4
9 7 8 3 1 2 6 4 5
//--
Expected: false
Actual: true

Should the correct answer be the truth?

All the rules are explained, and the link is there to let you read the rules fully.

About 3.

returns true if it is a valid solution, or false otherwise.

The cells of the sudoku board may also contain 0's, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.

You should return false when a 0 is on the board, yes. No other rule needed.

Your code being too slow is not a kata issue.

How long does your solution run for n=1853606873 ?

Not a kata issue, read this: https://docs.codewars.com/training/troubleshooting#print-input