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 listJun 19, 2026 04:20Victor MerckléVictor MerckléScore: 1,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 04:211,648256,327,024239,414,0007,868,00016,797,696
2Jun 19, 2026 04:211,648256,495,552239,360,0007,958,00016,797,696
3Jun 19, 2026 04:211,649256,567,456239,583,0007,877,00016,797,696
4Jun 19, 2026 04:211,649256,586,674239,586,0007,878,00016,797,696
5Jun 19, 2026 04:211,649256,581,132239,524,0007,909,00016,797,696
6Jun 19, 2026 04:211,650257,117,248239,509,0008,064,00016,797,696
7Jun 19, 2026 04:211,654257,350,321240,228,0007,973,00016,797,696
8Jun 19, 2026 04:211,655257,823,916240,370,0008,005,00016,797,696
9Jun 19, 2026 04:211,655257,534,662240,396,0007,995,00016,797,696