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 22:41Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 20:56Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 21:1308,575,851759,000024,576expected "33", got "50 "stderr
2Aug 17, 2026 22:461,5678,429,170627,000024,576stderr
3Aug 17, 2026 22:461,7208,521,573688,000024,576stderr
4Aug 17, 2026 22:461,7478,562,508699,000024,576stderr
5Aug 17, 2026 22:461,7928,547,400717,000024,576stderr
6Aug 17, 2026 22:461,8308,396,222732,000024,576stderr
7Aug 17, 2026 22:461,9208,669,632768,000024,576stderr
8Aug 17, 2026 22:461,9628,602,727785,000024,576stderr
9Aug 17, 2026 22:461,9808,624,330792,000024,576stderr
10Aug 17, 2026 22:461,9958,642,887798,000024,576stderr
11Sep 4, 2026 21:132,1878,861,620875,000024,576stderr
12Sep 4, 2026 21:132,4358,918,612974,000024,576stderr