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 23:27anboto1anboto1Score: 3,363Success
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 23:283,321508,213,684473,075,00025,210,00016,793,600
2Jul 29, 2026 23:283,336510,448,747474,846,00025,598,00016,793,600
3Jul 29, 2026 23:283,344513,284,756476,292,00025,451,00016,793,600
4Jul 29, 2026 23:283,354513,122,023477,962,00025,159,00016,793,600
5Jul 29, 2026 23:283,363514,359,102478,876,00025,606,00016,793,600
6Jul 29, 2026 23:283,363514,658,176478,897,00025,699,00016,793,600
7Jul 29, 2026 23:283,390518,668,713483,280,00025,347,00016,793,600
8Jul 29, 2026 23:283,446527,020,483492,113,00024,931,00016,793,600
9Jul 29, 2026 23:283,453528,143,330492,789,00025,256,00016,793,600