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 listNov 19, 2025 19:51Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 11:10C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 11:11010,655,6612,444,00002,117,632expected "300", got "343 "
2Sep 5, 2026 11:11010,655,5972,440,00002,117,632expected "300", got "343 "
3Sep 5, 2026 11:11010,658,4882,425,00002,117,632expected "300", got "343 "
4Nov 19, 2025 19:514,75821,217,34201,903,0002,392,064
5Nov 19, 2025 19:514,80317,840,4041,921,00002,392,064
6Nov 19, 2025 19:514,82019,861,2901,928,00002,387,968