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 listSep 5, 2026 16:35Victor MerckléVictor MerckléScore: 1,927Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 18:19NoSIMD_C#10.04CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 16:361,7959,565,401718,000020,480stderr
2Sep 5, 2026 16:361,8329,512,450733,000020,480stderr
3Sep 5, 2026 16:361,8778,942,251751,000020,480stderr
4Sep 5, 2026 16:361,9109,561,152764,000020,480stderr
5Sep 5, 2026 16:361,9279,601,050771,000020,480stderr
6Sep 5, 2026 16:362,02710,603,537811,000020,480stderr
7Sep 5, 2026 16:362,0309,668,821812,000020,480stderr
8Sep 5, 2026 16:362,0559,667,103822,000020,480stderr
9Sep 5, 2026 16:362,0579,621,775823,000020,480stderr