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 27, 2026 16:53Victor 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 27, 2026 16:541,661259,375,988240,650,0008,629,00016,818,176
2Jun 27, 2026 16:541,661260,021,214240,631,0008,621,00016,818,176
3Jun 27, 2026 16:541,661258,295,719240,588,0008,608,00016,818,176
4Jun 27, 2026 16:541,662258,506,205240,771,0008,634,00016,818,176
5Jun 27, 2026 16:541,662257,295,702240,806,0008,622,00016,818,176
6Jun 27, 2026 16:541,663260,213,672241,151,0008,443,00016,818,176
7Jun 27, 2026 16:541,666260,431,223241,001,0008,972,00016,818,176
8Jun 27, 2026 16:541,666258,892,379241,492,0008,506,00016,818,176
9Jun 27, 2026 16:541,669258,640,674242,122,0008,266,00016,818,176