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 listAug 30, 2026 19:21Victor MerckléVictor MerckléScore: 1,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:221,602248,562,694232,711,0007,690,00016,801,792stderr
2Aug 30, 2026 19:221,603248,676,238232,882,0007,674,00016,801,792stderr
3Aug 30, 2026 19:221,604248,995,286232,972,0007,723,00016,801,792stderr
4Aug 30, 2026 19:221,605248,894,010233,080,0007,683,00016,801,792stderr
5Aug 30, 2026 19:221,606249,242,554233,179,0007,791,00016,801,792stderr
6Aug 30, 2026 19:221,607249,392,942233,488,0007,695,00016,801,792stderr
7Aug 30, 2026 19:221,607249,239,890233,295,0007,780,00016,801,792stderr
8Aug 30, 2026 19:221,608249,410,709233,436,0007,824,00016,801,792stderr
9Aug 30, 2026 19:221,609249,674,707233,739,0007,689,00016,801,792stderr