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 17:11Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:58C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:5809,060,303799,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 14:5808,975,195792,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 14:5808,944,000751,00002,117,632expected "10000", got "100 "
4Jan 1, 2026 17:115,06522,450,6471,013,0001,013,0002,453,504
5Jan 1, 2026 17:115,33022,297,3771,066,0001,066,0002,273,280
6Jan 1, 2026 17:115,40517,672,7481,081,0001,081,0002,449,408
7Jan 1, 2026 17:115,42523,170,0381,085,0001,085,0002,277,376
8Jan 1, 2026 17:115,54019,415,4271,108,0001,108,0002,449,408
9Jan 1, 2026 17:116,10518,094,0252,442,00002,441,216