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 listJun 2, 2025 12:15KeefeKeefeError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:50C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:50016,836,5724,852,0001,117,0002,121,728expected "300", got "80 "
2Sep 5, 2026 10:50016,037,1124,890,0001,089,0002,121,728expected "300", got "80 "
3Sep 5, 2026 10:50016,844,2124,896,0001,090,0002,121,728expected "300", got "80 "
4Jun 2, 2025 12:1526,51527,616,70410,606,00002,265,088
5Jun 2, 2025 12:1526,89534,644,7719,683,0001,075,0002,285,568
6Jun 2, 2025 12:1527,52329,259,3469,008,0002,001,0002,289,664