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

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 11:01C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 11:0208,708,326531,000024,576expected "300", got "52 "stderr
2Sep 5, 2026 11:0208,711,674533,000024,576expected "300", got "52 "stderr
3Sep 5, 2026 11:0208,760,411530,000024,576expected "300", got "52 "stderr
4Aug 17, 2026 23:581,3628,524,498545,000024,576stderr
5Aug 17, 2026 23:581,5629,249,801625,000024,576stderr
6Aug 17, 2026 23:581,6179,383,674647,000024,576stderr
7Aug 17, 2026 23:581,68511,138,730674,000024,576stderr
8Aug 17, 2026 23:581,9659,695,364786,000024,576stderr
9Aug 17, 2026 23:582,0008,921,406800,000024,576stderr
10Aug 17, 2026 23:582,0108,957,427804,000024,576stderr
11Aug 17, 2026 23:582,0158,831,653806,000024,576stderr
12Aug 17, 2026 23:582,0259,501,066810,000024,576stderr