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 20:08Victor MerckléVictor MerckléScore: 1,610Success
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 20:091,608251,298,178233,360,0007,959,00016,801,792stderr
2Aug 30, 2026 20:091,608251,185,491233,377,0007,921,00016,801,792stderr
3Aug 30, 2026 20:091,608251,250,428233,443,0007,883,00016,801,792stderr
4Aug 30, 2026 20:091,609251,311,245233,453,0007,928,00016,801,792stderr
5Aug 30, 2026 20:091,610252,109,294233,573,0007,987,00016,801,792stderr
6Aug 30, 2026 20:091,611251,807,335233,645,0008,062,00016,801,792stderr
7Aug 30, 2026 20:091,611251,530,455233,736,0007,985,00016,801,792stderr
8Aug 30, 2026 20:091,611251,636,254233,808,0007,954,00016,801,792stderr
9Aug 30, 2026 20:091,614252,041,198234,112,0008,019,00016,801,792stderr