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 29, 2025 02:29zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:02C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:02016,312,9946,708,0001,084,0002,121,728expected "10000", got "255 "stderr
2Sep 7, 2026 15:02016,170,1267,686,00002,121,728expected "10000", got "255 "stderr
3Sep 7, 2026 15:02016,459,9786,705,0001,153,0002,121,728expected "10000", got "255 "stderr
4May 29, 2025 02:2920,50523,433,4156,152,0002,050,0002,424,832
5May 29, 2025 02:2920,71026,244,1937,249,0001,035,0002,420,736
6May 29, 2025 02:2920,73327,487,6257,257,0001,036,0002,416,640