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 17:12anboto1anboto1Score: 2,834Success
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 17:122,830434,790,913409,963,00014,598,00016,793,600
2Jul 29, 2026 17:122,833435,353,466410,286,00014,780,00016,793,600
3Jul 29, 2026 17:122,834435,405,716410,515,00014,691,00016,793,600
4Jul 29, 2026 17:122,834435,361,852410,508,00014,622,00016,793,600
5Jul 29, 2026 17:122,834435,655,009410,525,00014,589,00016,793,600
6Jul 29, 2026 17:122,842436,434,148411,688,00014,614,00016,793,600
7Jul 29, 2026 17:122,842436,490,903411,632,00014,730,00016,793,600
8Jul 29, 2026 17:122,847437,133,509412,337,00014,738,00016,793,600
9Jul 29, 2026 17:122,894455,016,236419,283,00014,837,00016,793,600