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:14Victor 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 20:171,604250,516,783232,834,0007,835,00016,801,792stderr
2Aug 30, 2026 20:171,604251,927,984232,614,0008,032,00016,801,792stderr
3Aug 30, 2026 20:171,605250,723,682232,985,0007,876,00016,801,792stderr
4Aug 30, 2026 20:171,606250,811,344233,050,0007,893,00016,801,792stderr
5Aug 30, 2026 20:171,606250,803,480232,989,0007,924,00016,801,792stderr
6Aug 30, 2026 20:171,608251,127,184233,269,0007,986,00016,801,792stderr
7Aug 30, 2026 20:171,608251,165,999233,376,0007,926,00016,801,792stderr
8Aug 30, 2026 20:171,609251,260,541233,576,0007,833,00016,801,792stderr
9Aug 30, 2026 20:171,611251,468,393233,785,0007,889,00016,801,792stderr