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 17, 2026 16:36Victor MerckléVictor MerckléScore: 1,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 16:371,660258,113,884241,407,0007,639,00016,797,696
2Jun 17, 2026 16:371,661258,423,093241,635,0007,638,00016,797,696
3Jun 17, 2026 16:371,661258,361,868241,591,0007,680,00016,797,696
4Jun 17, 2026 16:371,662258,493,986241,694,0007,688,00016,797,696
5Jun 17, 2026 16:371,662258,501,126241,624,0007,708,00016,797,696
6Jun 17, 2026 16:371,663259,101,542241,667,0007,799,00016,797,696
7Jun 17, 2026 16:371,667259,261,201242,311,0007,771,00016,797,696
8Jun 17, 2026 16:371,668260,800,308242,545,0007,765,00016,797,696
9Jun 17, 2026 16:371,669259,447,708242,525,0007,849,00016,797,696