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 31, 2026 00:46Tomislav TunkovicTomislav TunkovicScore: 4,900Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 8, 2026 06:28C#_user10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 00:544,75011,317,27401,900,00045,056
2Aug 31, 2026 00:544,78711,351,40501,915,00045,056
3Aug 31, 2026 00:544,81011,310,69201,924,00045,056
4Aug 31, 2026 00:544,87711,427,37501,951,00045,056
5Aug 31, 2026 00:544,90011,333,39801,960,00045,056
6Aug 31, 2026 00:544,93011,362,14201,972,00045,056
7Aug 31, 2026 00:544,93511,464,30701,974,00045,056
8Aug 31, 2026 00:545,26024,746,96402,104,00045,056
9Aug 31, 2026 00:545,28523,547,93702,114,00045,056