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 2, 2026 10:20A_ShamanA_ShamanScore: 4,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 10:214,011611,198,928575,462,00026,293,00016,793,600
2Jul 2, 2026 10:214,013611,896,890576,043,00025,944,00016,793,600
3Jul 2, 2026 10:214,023612,942,775577,088,00026,423,00016,793,600
4Jul 2, 2026 10:214,027613,517,907577,592,00026,510,00016,793,600
5Jul 2, 2026 10:214,029613,999,467577,726,00026,760,00016,793,600
6Jul 2, 2026 10:214,041615,640,934579,106,00027,138,00016,793,600
7Jul 2, 2026 10:214,048616,808,864581,068,00026,226,00016,793,600
8Jul 2, 2026 10:214,051617,220,059581,118,00026,547,00016,793,600
9Jul 2, 2026 10:214,056618,053,243582,453,00026,091,00016,793,600