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 23:02Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 00:45Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 02:2608,713,211787,000024,576expected "2", got "50 "stderr
2Aug 17, 2026 23:081,3358,354,583534,000024,576stderr
3Aug 17, 2026 23:081,4379,758,827575,000024,576stderr
4Aug 17, 2026 23:081,6628,475,926665,000024,576stderr
5Aug 17, 2026 23:081,7808,529,731712,000024,576stderr
6Aug 17, 2026 23:081,8058,616,202722,000024,576stderr
7Aug 17, 2026 23:081,8208,688,230728,000024,576stderr
8Aug 17, 2026 23:082,0329,475,688813,000024,576stderr
9Aug 17, 2026 23:082,0378,712,868815,000024,576stderr
10Aug 17, 2026 23:082,0428,737,236817,000024,576stderr
11Sep 5, 2026 02:262,1278,866,364851,000024,576stderr
12Sep 5, 2026 02:262,6909,079,2471,076,000024,576stderr