Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listSep 15, 2026 15:41Haha ExpertHaha ExpertScore: 4,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 15:444,639706,327,251686,439,0009,549,00016,793,600
2Sep 15, 2026 15:444,641706,694,764686,795,0009,477,00016,793,600
3Sep 15, 2026 15:444,646708,440,573687,414,0009,501,00016,793,600
4Sep 15, 2026 15:444,646707,138,932687,467,0009,493,00016,793,600
5Sep 15, 2026 15:444,650708,493,245688,024,0009,492,00016,793,600
6Sep 15, 2026 15:444,652708,273,145688,519,0009,426,00016,793,600
7Sep 15, 2026 15:444,653708,338,067688,589,0009,473,00016,793,600
8Sep 15, 2026 15:444,656708,785,087689,001,0009,468,00016,793,600
9Sep 15, 2026 15:444,657708,908,338689,111,0009,486,00016,793,600