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 3, 2026 04:52Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:15C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:1509,032,577707,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:1509,015,611804,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:15010,267,675769,00002,117,632expected "10000", got "100 "
4Jan 3, 2026 04:525,52519,782,5661,105,0001,105,0002,277,376
5Jan 3, 2026 04:525,72819,426,72402,291,0002,437,120
6Jan 3, 2026 04:525,90820,030,2242,363,00002,441,216