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 08:02Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:17C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:18010,917,4031,220,00002,121,728expected "10000", got "100 "
2Sep 7, 2026 15:18010,941,1291,191,00002,121,728expected "10000", got "100 "
3Sep 7, 2026 15:18010,903,8181,118,00002,121,728expected "10000", got "100 "
4Jan 1, 2026 08:026,29820,847,0142,519,00002,486,272
5Jan 1, 2026 08:026,33821,738,3292,535,00002,363,392
6Jan 1, 2026 08:026,39318,085,2222,557,00002,367,488