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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:16C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:1608,930,972823,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:1609,045,039819,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:1609,090,229823,00002,117,632expected "10000", got "100 "
4Jan 1, 2026 16:355,66819,299,9362,267,00002,416,640
5Jan 1, 2026 16:355,89517,591,3562,358,00002,428,928
6Jan 1, 2026 16:355,91015,272,5482,364,00002,441,216