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 27, 2026 10:49Victor MerckléVictor MerckléScore: 1,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 10:501,627254,669,331236,200,0007,901,00016,801,792stderr
2Aug 27, 2026 10:501,627253,854,927236,226,0007,834,00016,801,792stderr
3Aug 27, 2026 10:501,627254,074,363236,267,0007,876,00016,801,792stderr
4Aug 27, 2026 10:501,627254,064,238236,260,0007,911,00016,801,792stderr
5Aug 27, 2026 10:501,628254,168,285236,344,0007,900,00016,801,792stderr
6Aug 27, 2026 10:501,629254,262,389236,454,0007,972,00016,801,792stderr
7Aug 27, 2026 10:501,631254,581,225236,782,0007,990,00016,801,792stderr
8Aug 27, 2026 10:501,631254,524,515236,714,0007,965,00016,801,792stderr
9Aug 27, 2026 10:501,631254,468,974236,703,0007,955,00016,801,792stderr