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 18, 2026 20:18Victor MerckléVictor MerckléScore: 1,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 20:191,653257,148,508240,070,0007,889,00016,797,696
2Jun 18, 2026 20:191,653257,132,877240,161,0007,839,00016,797,696
3Jun 18, 2026 20:191,653257,129,589240,149,0007,865,00016,797,696
4Jun 18, 2026 20:191,653257,150,478240,075,0007,887,00016,797,696
5Jun 18, 2026 20:191,654257,626,683240,238,0007,890,00016,797,696
6Jun 18, 2026 20:191,655257,444,728240,361,0007,967,00016,797,696
7Jun 18, 2026 20:191,658257,825,513240,797,0007,938,00016,797,696
8Jun 18, 2026 20:191,658257,766,908240,813,0007,888,00016,797,696
9Jun 18, 2026 20:191,659258,077,030241,019,0007,973,00016,797,696