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 00:46zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:53C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:53011,544,4841,632,0001,632,0002,121,728expected "10000", got "32 "stderr
2Sep 7, 2026 14:53011,516,6941,624,0001,625,0002,121,728expected "10000", got "32 "stderr
3Sep 7, 2026 14:53011,543,2281,580,0001,581,0002,121,728expected "10000", got "32 "stderr
4May 31, 2025 00:467,28320,905,434971,0001,942,0002,510,848
5May 31, 2025 00:467,56321,024,5571,008,0002,017,0002,416,640
6May 31, 2025 00:467,83818,623,88203,135,0002,531,328