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 12:41Victor 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 12:431,652257,100,607240,017,0007,873,00016,797,696
2Jun 19, 2026 12:431,653257,182,883240,135,0007,942,00016,797,696
3Jun 19, 2026 12:431,653257,111,537240,057,0007,928,00016,797,696
4Jun 19, 2026 12:431,653258,157,152240,082,0007,869,00016,797,696
5Jun 19, 2026 12:431,653257,299,439240,146,0007,938,00016,797,696
6Jun 19, 2026 12:431,655257,533,851240,375,0007,934,00016,797,696
7Jun 19, 2026 12:431,657257,816,611240,746,0007,933,00016,797,696
8Jun 19, 2026 12:431,657257,772,840240,775,0007,913,00016,797,696
9Jun 19, 2026 12:431,658257,875,073240,882,0007,906,00016,797,696