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 listJul 29, 2026 21:24anboto1anboto1Score: 3,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 21:243,466529,951,995491,043,00028,962,00016,793,600
2Jul 29, 2026 21:243,467530,098,938490,800,00029,293,00016,793,600
3Jul 29, 2026 21:243,468530,244,594490,980,00029,245,00016,793,600
4Jul 29, 2026 21:243,469530,509,487490,939,00029,459,00016,793,600
5Jul 29, 2026 21:243,469530,449,896491,476,00028,953,00016,793,600
6Jul 29, 2026 21:243,469530,364,886491,366,00029,056,00016,793,600
7Jul 29, 2026 21:243,469530,446,384491,362,00029,015,00016,793,600
8Jul 29, 2026 21:243,478532,349,948492,614,00029,134,00016,793,600
9Jul 29, 2026 21:243,508536,380,286496,743,00029,547,00016,793,600