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 10:58Victor MerckléVictor MerckléScore: 1,618Success
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 10:591,617252,633,288234,795,0007,884,00016,801,792stderr
2Aug 27, 2026 10:591,617252,555,227234,735,0007,859,00016,801,792stderr
3Aug 27, 2026 10:591,617253,277,623234,739,0007,912,00016,801,792stderr
4Aug 27, 2026 10:591,618252,724,797234,805,0007,951,00016,801,792stderr
5Aug 27, 2026 10:591,618253,846,179234,848,0007,984,00016,801,792stderr
6Aug 27, 2026 10:591,619252,812,746235,082,0007,868,00016,801,792stderr
7Aug 27, 2026 10:591,619252,929,204234,929,0008,055,00016,801,792stderr
8Aug 27, 2026 10:591,621253,143,532235,286,0007,998,00016,801,792stderr
9Aug 27, 2026 10:591,622253,218,576235,295,0008,011,00016,801,792stderr