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 13:57Victor MerckléVictor MerckléScore: 1,609Success
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 13:581,607251,805,959233,200,0007,997,00016,801,792stderr
2Aug 27, 2026 13:581,608251,177,832233,303,0007,946,00016,801,792stderr
3Aug 27, 2026 13:581,608251,157,435233,408,0007,888,00016,801,792stderr
4Aug 27, 2026 13:581,609252,042,106233,534,0007,916,00016,801,792stderr
5Aug 27, 2026 13:581,609253,340,592233,341,0008,016,00016,801,792stderr
6Aug 27, 2026 13:581,610251,466,626233,679,0007,915,00016,801,792stderr
7Aug 27, 2026 13:581,611251,636,575233,795,0007,960,00016,801,792stderr
8Aug 27, 2026 13:581,611251,532,667233,743,0007,997,00016,801,792stderr
9Aug 27, 2026 13:581,611251,568,829233,772,0007,975,00016,801,792stderr