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 3, 2026 04:46Victor MerckléVictor MerckléScore: 2,090Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 04:492,082322,317,029304,191,0008,204,00016,801,792stderr
2Aug 3, 2026 04:492,084322,510,029304,648,0008,014,00016,801,792stderr
3Aug 3, 2026 04:492,087323,030,831305,214,0007,902,00016,801,792stderr
4Aug 3, 2026 04:492,089323,343,115305,539,0007,915,00016,801,792stderr
5Aug 3, 2026 04:492,090323,447,149305,469,0008,092,00016,801,792stderr
6Aug 3, 2026 04:492,090323,522,359305,526,0008,112,00016,801,792stderr
7Aug 3, 2026 04:492,092323,740,675305,745,0008,101,00016,801,792stderr
8Aug 3, 2026 04:492,095324,183,935306,362,0008,009,00016,801,792stderr
9Aug 3, 2026 04:492,096324,289,027306,410,0008,036,00016,801,792stderr