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 listMay 28, 2025 12:55vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:55C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:55017,118,7698,843,00002,113,536expected "10000", got "245 "
2Sep 7, 2026 14:55017,008,4708,842,00002,113,536expected "10000", got "245 "
3Sep 7, 2026 14:55017,149,5468,843,00002,113,536expected "10000", got "245 "
4May 28, 2025 12:5528,02331,262,22610,190,0001,019,0002,482,176
5May 28, 2025 12:5528,09825,614,06610,218,0001,021,0002,273,280
6May 28, 2025 12:5528,23528,457,60210,268,0001,026,0002,486,272