Largest Square Submatrix of all 1's C#_user

Find the largest square submatrix consisting entirely of 1s as fast as possible.

Input

A 10,000 x 10,000 matrix of uint8 values (0 or 1) on STDIN.

0, 1, 0, 1, 1
0, 1, 1, 1, 1
0, 0, 1, 0, 0
1, 0, 1, 1, 0

Output

Print the side length of the largest all-ones square submatrix to STDOUT. The answer is guaranteed to be greater than 1.

For the example above, the output is:

2
Back to listMay 29, 2025 02:37zielajzielajError
Source Code

Source code access is restricted. Log in to request access.

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:58C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:58016,104,6776,647,0001,015,0002,121,728expected "10000", got "255 "stderr
2Sep 7, 2026 14:58016,251,0686,627,0001,012,0002,121,728expected "10000", got "255 "stderr
3Sep 7, 2026 14:58016,135,8216,658,0001,007,0002,121,728expected "10000", got "255 "stderr
4May 29, 2025 02:3720,25022,811,2517,088,0001,012,0002,420,736
5May 29, 2025 02:3720,29324,455,1486,088,0002,029,0002,424,832
6May 29, 2025 02:3720,30028,943,2837,105,0001,015,0002,424,832