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 listJul 1, 2026 05:33Victor MerckléVictor MerckléScore: 1,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 05:341,653257,456,929240,238,0007,829,00016,801,792stderr
2Jul 1, 2026 05:341,653257,291,638240,104,0007,847,00016,801,792stderr
3Jul 1, 2026 05:341,654257,679,495240,314,0007,934,00016,801,792stderr
4Jul 1, 2026 05:341,654257,536,786240,243,0007,880,00016,801,792stderr
5Jul 1, 2026 05:341,655257,672,594240,348,0007,958,00016,801,792stderr
6Jul 1, 2026 05:341,655257,728,007240,327,0007,938,00016,801,792stderr
7Jul 1, 2026 05:341,657258,049,214240,780,0007,890,00016,801,792stderr
8Jul 1, 2026 05:341,659258,264,601240,916,0007,969,00016,801,792stderr
9Jul 1, 2026 05:341,660258,455,837241,081,0007,948,00016,801,792stderr