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 3, 2026 02:44f0xerif0xeriScore: 57,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 02:5855,0248,263,498,5698,208,601,00045,019,00016,793,600
2Jul 3, 2026 02:5857,5068,635,571,7238,587,518,00038,446,00016,793,600
3Jul 3, 2026 02:5857,9048,696,072,9048,647,148,00038,595,00016,793,600