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 14:27Victor MerckléVictor MerckléScore: 1,879Success
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 14:281,867289,995,310272,229,0007,880,00016,801,792stderr
2Aug 27, 2026 14:281,867289,991,237272,154,0007,913,00016,801,792stderr
3Aug 27, 2026 14:281,870290,637,942272,489,0008,140,00016,801,792stderr
4Aug 27, 2026 14:281,877291,468,519273,641,0007,958,00016,801,792stderr
5Aug 27, 2026 14:281,879291,752,880273,972,0007,923,00016,801,792stderr
6Aug 27, 2026 14:281,879291,868,555274,011,0007,962,00016,801,792stderr
7Aug 27, 2026 14:281,880291,864,686274,029,0007,987,00016,801,792stderr
8Aug 27, 2026 14:281,881292,478,913274,259,0008,003,00016,801,792stderr
9Aug 27, 2026 14:281,883292,376,485274,565,0007,928,00016,801,792stderr