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

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 14:31Tomislav Tunkovic116.71CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 16:1409,542,487774,000024,576expected "2", got "50 "stderr
2Sep 4, 2026 16:1408,832,167778,000024,576expected "4", got "50 "stderr
3Sep 4, 2026 16:1408,850,741785,000024,576expected "2", got "50 "stderr
4Aug 17, 2026 22:081,2709,186,793508,000024,576stderr
5Aug 17, 2026 22:081,3008,918,799520,000024,576stderr
6Aug 17, 2026 22:081,3459,022,985538,000024,576stderr
7Aug 17, 2026 22:081,4859,255,304594,000024,576stderr
8Aug 17, 2026 22:081,5359,149,544614,000024,576stderr
9Aug 17, 2026 22:081,6978,731,541679,000024,576stderr
10Aug 17, 2026 22:081,7959,383,673718,000024,576stderr
11Aug 17, 2026 22:082,0329,558,658813,000024,576stderr
12Aug 17, 2026 22:082,04710,841,031819,000024,576stderr