Largest Square Submatrix of all 1's NoSIMD_C#

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 22:02zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 11:13NoSIMD_C#10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 11:13010,331,5102,014,00002,121,728expected "300", got "549 "stderr
2Sep 5, 2026 11:13010,325,5691,034,0001,025,0002,121,728expected "300", got "549 "stderr
3Sep 5, 2026 11:13010,992,3441,043,0001,028,0002,121,728expected "300", got "549 "stderr
4May 31, 2025 22:024,78318,815,71101,913,0002,506,752
5May 31, 2025 22:024,79823,577,89601,919,0002,424,832
6May 31, 2025 22:025,11518,049,64902,046,0002,277,376