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 11:51KeefeKeefeError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:55C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:57016,409,2165,638,00002,117,632expected "300", got "80 "
2Sep 5, 2026 10:57015,609,6054,523,0001,184,0002,117,632expected "300", got "80 "
3Sep 5, 2026 10:57015,692,8174,723,0001,037,0002,117,632expected "300", got "80 "
4Jun 2, 2025 11:5127,21529,471,0229,897,000989,0002,400,256
5Jun 2, 2025 11:5127,25529,170,4938,920,0001,982,0002,387,968
6Jun 2, 2025 11:5127,64027,906,5249,046,0002,010,0002,273,280