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 listFeb 16, 2026 23:02Valentin KofmanValentin KofmanScore: 3,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 23:023,925612,393,276578,749,0009,995,00017,162,240
2Feb 16, 2026 23:023,930616,216,888579,549,0009,992,00016,965,632
3Feb 16, 2026 23:023,933615,092,289579,938,0009,998,00017,088,512
4Feb 16, 2026 23:023,934617,951,990583,048,0007,000,00016,965,632
5Feb 16, 2026 23:023,937617,958,132579,511,00010,990,00017,129,472
6Feb 16, 2026 23:023,939613,548,733580,787,0009,996,00017,182,720