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 29, 2025 03:18zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:57C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:57016,019,7386,518,0001,018,0002,121,728expected "10000", got "255 "stderr
2Sep 7, 2026 14:57016,072,7046,532,0001,019,0002,121,728expected "10000", got "255 "stderr
3Sep 7, 2026 14:57015,984,9306,524,0001,009,0002,121,728expected "10000", got "255 "stderr
4May 29, 2025 03:1820,07021,296,8396,021,0002,007,0002,420,736
5May 29, 2025 03:1820,09326,560,0266,028,0002,009,0002,412,544
6May 29, 2025 03:1820,10525,574,8036,032,0002,010,0002,527,232