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 20:47anboto1anboto1Score: 3,329Success
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 20:473,322508,166,210471,790,00026,535,00016,793,600
2Jul 29, 2026 20:473,325508,753,590472,697,00026,106,00016,793,600
3Jul 29, 2026 20:473,325508,961,082471,950,00026,930,00016,793,600
4Jul 29, 2026 20:473,326509,057,976471,977,00027,027,00016,793,600
5Jul 29, 2026 20:473,329509,544,162472,885,00026,612,00016,793,600
6Jul 29, 2026 20:473,336510,342,837473,175,00027,250,00016,793,600
7Jul 29, 2026 20:473,338510,728,632474,188,00026,593,00016,793,600
8Jul 29, 2026 20:473,350512,572,513476,343,00026,249,00016,793,600
9Jul 29, 2026 20:473,352512,928,656476,732,00026,212,00016,793,600