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:58Victor MerckléVictor MerckléScore: 1,607Success
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:591,605250,813,644232,993,0007,871,00016,801,792stderr
2Aug 27, 2026 14:591,605250,711,029232,854,0007,927,00016,801,792stderr
3Aug 27, 2026 14:591,606250,932,162233,105,0007,923,00016,801,792stderr
4Aug 27, 2026 14:591,606251,122,392233,003,0007,931,00016,801,792stderr
5Aug 27, 2026 14:591,607251,022,379233,126,0008,012,00016,801,792stderr
6Aug 27, 2026 14:591,608251,200,200233,395,0007,940,00016,801,792stderr
7Aug 27, 2026 14:591,609251,320,386233,479,0007,948,00016,801,792stderr
8Aug 27, 2026 14:591,610251,487,742233,587,0008,005,00016,801,792stderr
9Aug 27, 2026 14:591,611251,654,352233,803,0007,976,00016,801,792stderr