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 listApr 16, 2026 23:54olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:34Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:34013,498,6352,437,0001,059,0002,121,728expected "7", got "50"
2Sep 9, 2026 10:34014,059,8092,286,0001,090,0002,121,728expected "2", got "50"
3Apr 16, 2026 23:546,89818,506,1022,759,00002,293,760
4Apr 16, 2026 23:548,46320,455,5213,385,00002,293,760
5Apr 16, 2026 23:548,61022,807,3112,296,0001,148,0002,514,944
6Sep 9, 2026 10:349,74013,981,4352,823,0001,073,0002,125,824