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:55Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:49C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:50010,745,8272,438,00002,117,632expected "300", got "343 "
2Sep 5, 2026 10:50010,858,7062,297,00002,117,632expected "300", got "343 "
3Sep 5, 2026 10:50010,783,7742,298,00002,117,632expected "300", got "343 "
4Nov 19, 2025 19:553,11520,550,4951,246,00002,449,408
5Nov 19, 2025 19:553,20815,583,2481,283,00002,445,312
6Nov 19, 2025 19:554,34314,710,26101,737,0002,387,968
7Nov 19, 2025 19:554,51522,482,3531,806,00002,387,968
8Nov 19, 2025 19:554,66521,361,79501,866,0002,387,968
9Nov 19, 2025 19:555,04521,136,0161,009,0001,009,0002,265,088