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 5, 2026 02:32Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:20C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:2008,824,856717,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:2008,938,853794,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:2008,961,104734,00002,117,632expected "10000", got "100 "
4Jan 5, 2026 02:3214,80821,683,5674,936,000987,0002,535,424
5Jan 5, 2026 02:3215,02022,352,5065,007,0001,001,0002,535,424
6Jan 5, 2026 02:3215,06021,492,6724,016,0002,008,0002,453,504