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 11:12Victor MerckléVictor MerckléScore: 1,645Success
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 11:131,642256,276,464238,560,0007,865,00016,801,792stderr
2Aug 27, 2026 11:131,644256,560,167238,753,0007,939,00016,801,792stderr
3Aug 27, 2026 11:131,644256,560,973238,815,0007,889,00016,801,792stderr
4Aug 27, 2026 11:131,644256,666,737238,765,0007,934,00016,801,792stderr
5Aug 27, 2026 11:131,645256,753,573238,745,0008,051,00016,801,792stderr
6Aug 27, 2026 11:131,645257,293,385238,755,0008,001,00016,801,792stderr
7Aug 27, 2026 11:131,648257,347,496239,215,0007,994,00016,801,792stderr
8Aug 27, 2026 11:131,648260,220,988239,291,0008,018,00016,801,792stderr
9Aug 27, 2026 11:131,649257,950,000239,465,0007,963,00016,801,792stderr