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 1, 2026 15:58Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:13C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:13010,664,988914,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:13010,616,435914,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:13010,617,730913,00002,117,632expected "10000", got "100 "
4Jan 1, 2026 15:585,58023,284,9741,116,0001,116,0002,408,448
5Jan 1, 2026 15:585,69026,052,6592,276,00002,383,872
6Jan 1, 2026 15:586,05321,127,2452,421,00002,400,256