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 listNov 4, 2026 01:48Andrew EpsteinAndrew EpsteinScore: 23,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 01:4923,4243,523,977,2033,458,520,00055,209,00016,801,792stderr
2Nov 4, 2026 01:4923,4283,523,660,5913,459,496,00054,770,00016,801,792stderr
3Nov 4, 2026 01:4923,4313,524,885,7863,459,770,00054,972,00016,801,792stderr
4Nov 4, 2026 01:4923,4313,524,600,3443,459,884,00054,830,00016,801,792stderr
5Nov 4, 2026 01:4923,4343,524,556,3193,460,129,00054,998,00016,801,792stderr
6Nov 4, 2026 01:4923,4343,525,102,3423,460,415,00054,764,00016,801,792stderr
7Nov 4, 2026 01:4923,4803,532,153,6093,466,779,00055,368,00016,801,792stderr
8Nov 4, 2026 01:4923,4843,532,545,2963,467,344,00055,305,00016,801,792stderr
9Nov 4, 2026 01:4923,4843,532,583,0513,467,381,00055,333,00016,801,792stderr