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 16:49anboto1anboto1Score: 3,004Success
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 16:502,999459,990,404441,298,0008,645,00016,793,600
2Jul 29, 2026 16:503,000460,046,892441,333,0008,699,00016,793,600
3Jul 29, 2026 16:503,000460,011,279441,454,0008,650,00016,793,600
4Jul 29, 2026 16:503,003460,663,621441,851,0008,744,00016,793,600
5Jul 29, 2026 16:503,004460,837,980442,110,0008,610,00016,793,600
6Jul 29, 2026 16:503,005460,820,585442,124,0008,685,00016,793,600
7Jul 29, 2026 16:503,006461,111,582442,392,0008,646,00016,793,600
8Jul 29, 2026 16:503,007461,127,411442,466,0008,670,00016,793,600
9Jul 29, 2026 16:503,043477,069,075447,790,0008,668,00016,793,600