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 14, 2026 10:35Victor MerckléVictor MerckléScore: 2,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 10:382,861438,866,742421,145,0008,129,00016,801,792stderr
2Jul 14, 2026 10:382,865439,386,520421,627,0008,186,00016,801,792stderr
3Jul 14, 2026 10:382,867439,830,563422,030,0008,147,00016,801,792stderr
4Jul 14, 2026 10:382,877441,176,182423,249,0008,302,00016,801,792stderr
5Jul 14, 2026 10:382,880441,798,322423,939,0008,161,00016,801,792stderr
6Jul 14, 2026 10:382,884442,365,995424,441,0008,211,00016,801,792stderr
7Jul 14, 2026 10:382,884442,193,202424,554,0008,078,00016,801,792stderr
8Jul 14, 2026 10:382,888442,881,778425,059,0008,175,00016,801,792stderr
9Jul 14, 2026 10:382,888444,181,937424,995,0008,214,00016,801,792stderr