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 31, 2025 23:25zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:50C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:5109,659,8791,292,00002,121,728expected "10000", got "50 "stderr
2Sep 7, 2026 14:5109,661,9181,298,00002,121,728expected "10000", got "50 "stderr
3Sep 7, 2026 14:5109,629,4441,295,00002,121,728expected "10000", got "50 "stderr
4May 31, 2025 23:254,92022,016,855984,000984,0002,420,736
5May 31, 2025 23:256,22515,877,7041,245,0001,245,0002,424,832
6May 31, 2025 23:256,95517,018,9261,391,0001,391,0002,416,640