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 listMay 31, 2025 23:00vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:44C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:44017,181,3626,269,0001,038,0002,121,728expected "10000", got " "stderr
2Sep 7, 2026 14:44017,225,7946,260,0001,015,0002,121,728expected "10000", got " "stderr
3Sep 7, 2026 14:44017,195,4946,242,0001,027,0002,121,728expected "10000", got " "stderr
4May 31, 2025 23:0019,29328,306,2916,615,0001,102,0002,277,376
5May 31, 2025 23:0019,32322,529,8377,729,00002,277,376
6May 31, 2025 23:0019,35823,545,4147,743,00002,277,376