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 04:16Josu 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:0309,220,282899,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:0309,029,615899,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:0308,979,088900,00002,117,632expected "10000", got "100 "
4Jan 4, 2026 04:185,29519,920,87202,118,0002,453,504
5Jan 4, 2026 04:185,36322,403,65202,145,0002,449,408
6Jan 4, 2026 04:165,40517,706,0631,081,0001,081,0002,445,312
7Jan 4, 2026 04:185,46517,710,99202,186,0002,453,504
8Jan 4, 2026 04:165,47021,863,88802,188,0002,437,120
9Jan 4, 2026 04:165,87517,918,89802,350,0002,457,600