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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:20C#_user116.84CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:20010,169,68701,525,0002,195,456expected "10000", got "100 "
2Sep 7, 2026 15:20012,320,7851,400,00002,195,456expected "10000", got "100 "
3Sep 7, 2026 15:20011,301,1931,377,00002,158,592expected "10000", got "100 "
4Jan 1, 2026 16:018,19319,969,83703,277,0002,342,912
5Jan 1, 2026 16:018,32822,069,5692,221,0001,110,0002,342,912
6Jan 1, 2026 16:018,32820,754,5261,110,0002,221,0002,506,752