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 listJan 4, 2026 06:38Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:03C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:0308,986,394710,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:0308,999,290781,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:0308,827,006800,00002,117,632expected "10000", got "100 "
4Jan 4, 2026 06:385,21819,361,73402,087,0002,445,312
5Jan 4, 2026 06:385,37522,094,7501,075,0001,075,0002,445,312
6Jan 4, 2026 06:385,39819,200,67302,159,0002,445,312
7Jan 4, 2026 06:385,46518,298,5821,093,0001,093,0002,535,424
8Jan 4, 2026 06:385,47022,362,2481,094,0001,094,0002,449,408
9Jan 4, 2026 06:385,66319,031,6982,265,00002,445,312