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 listJan 1, 2026 16:36Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:08C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:0808,981,915823,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:0809,640,440908,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:0809,124,903813,00002,117,632expected "10000", got "100 "
4Jan 1, 2026 16:365,23015,268,6031,046,0001,046,0002,433,024
5Jan 1, 2026 16:365,55018,558,2291,110,0001,110,0002,433,024
6Jan 1, 2026 16:365,64516,618,9881,129,0001,129,0002,445,312