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:05Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:21C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:2106,257,830,9406,248,055,0001,052,0002,117,632expected "10000", got "199 "
2Sep 7, 2026 15:2106,257,479,5136,247,667,0001,243,0002,117,632expected "10000", got "199 "
3Sep 7, 2026 15:2106,257,345,7246,247,817,0001,101,0002,117,632expected "10000", got "199 "
4Jan 1, 2026 16:0521,57330,260,6428,629,00002,535,424
5Jan 1, 2026 16:0522,27524,932,0616,930,0001,980,0002,445,312
6Jan 1, 2026 16:0524,75027,338,8678,910,000990,0002,535,424