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 31, 2025 22:43zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:38C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:3809,684,9461,295,00002,121,728expected "10000", got "50 "stderr
2Sep 7, 2026 14:3809,712,3351,332,00002,121,728expected "10000", got "50 "stderr
3Sep 7, 2026 14:3809,675,9361,245,00002,121,728expected "10000", got "50 "stderr
4May 31, 2025 22:434,48018,977,7981,792,00002,416,640
5May 31, 2025 22:434,80821,571,72701,923,0002,428,928
6May 31, 2025 22:434,88319,081,15701,953,0002,424,832