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 listApr 20, 2026 21:34olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 11:07C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 11:0709,153,2201,184,00002,117,632expected "300", got "103"
2Sep 5, 2026 11:0709,034,7341,098,00002,117,632expected "300", got "103"
3Sep 5, 2026 11:0709,264,7521,095,00002,117,632expected "300", got "103"
4Apr 20, 2026 21:354,7107,968,74201,884,0002,465,792
5Apr 20, 2026 21:354,72019,879,43301,888,0002,465,792
6Apr 20, 2026 21:354,9908,022,62201,996,0002,473,984