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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:41C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:4108,846,663830,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 14:4108,854,521828,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 14:4108,895,985828,00002,117,632expected "10000", got "100 "
4Jan 5, 2026 02:464,04516,978,0611,618,00002,441,216
5Jan 5, 2026 02:464,47015,168,3031,788,00002,437,120
6Jan 5, 2026 02:464,48317,813,9821,793,00002,453,504