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:25Victor MerckléVictor MerckléScore: 1,653Success
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:261,652256,849,077239,855,0007,951,00016,797,696
2Jun 19, 2026 04:261,652256,947,287240,014,0007,844,00016,797,696
3Jun 19, 2026 04:261,652257,053,501240,006,0007,881,00016,797,696
4Jun 19, 2026 04:261,653257,195,541240,027,0008,059,00016,797,696
5Jun 19, 2026 04:261,653257,116,361239,991,0007,961,00016,797,696
6Jun 19, 2026 04:261,654257,226,716240,182,0007,929,00016,797,696
7Jun 19, 2026 04:261,657257,704,476240,631,0007,940,00016,797,696
8Jun 19, 2026 04:261,657257,752,732240,745,0007,951,00016,797,696
9Jun 19, 2026 04:261,660259,678,085241,086,0008,042,00016,797,696