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:08Victor MerckléVictor MerckléScore: 1,648Success
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:091,646256,107,702239,061,0007,879,00016,797,696
2Jun 18, 2026 20:091,646256,230,002239,256,0007,781,00016,797,696
3Jun 18, 2026 20:091,646256,128,817239,063,0007,880,00016,797,696
4Jun 18, 2026 20:091,648256,420,270239,295,0007,922,00016,797,696
5Jun 18, 2026 20:091,648256,781,364239,300,0007,947,00016,797,696
6Jun 18, 2026 20:091,648256,328,279239,308,0007,919,00016,797,696
7Jun 18, 2026 20:091,653257,158,872240,090,0007,986,00016,797,696
8Jun 18, 2026 20:091,654257,244,121240,131,0007,989,00016,797,696
9Jun 18, 2026 20:091,654257,218,675240,120,0008,031,00016,797,696