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 3, 2025 23:56zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:36C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:3709,365,2821,082,00002,117,632expected "300", got "57 "
2Sep 5, 2026 10:3709,316,5061,089,00002,117,632expected "300", got "57 "
3Sep 5, 2026 10:3709,409,4201,008,00002,117,632expected "300", got "57 "
4Jun 3, 2025 23:563,55515,740,4551,422,00002,510,848
5Jun 3, 2025 23:564,02319,991,9791,609,00002,420,736
6Jun 3, 2025 23:564,06816,478,6701,627,00002,424,832