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 listAug 17, 2026 07:34marko1597marko1597Score: 2,795Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 11:42Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 07:372,5979,190,1781,039,00002,117,632stderr
2Aug 17, 2026 07:372,7609,143,3571,104,00002,117,632stderr
3Aug 17, 2026 07:372,7629,170,3341,105,00002,117,632stderr
4Aug 17, 2026 07:372,7809,146,6901,112,00002,117,632stderr
5Aug 17, 2026 07:372,7959,234,3621,118,00002,117,632stderr
6Aug 17, 2026 07:372,7979,097,5181,119,00002,117,632stderr
7Aug 17, 2026 07:372,9029,148,4611,161,00002,117,632stderr
8Aug 17, 2026 07:372,9279,242,3621,171,00002,117,632stderr
9Aug 17, 2026 07:372,9629,378,5421,185,00002,117,632stderr