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 00:43Andrew EpsteinAndrew EpsteinScore: 23,559Success
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 00:4423,5543,543,268,9403,478,357,00054,775,00016,801,792stderr
2Nov 4, 2026 00:4423,5553,543,495,2603,478,643,00054,703,00016,801,792stderr
3Nov 4, 2026 00:4423,5563,543,518,9493,478,663,00054,766,00016,801,792stderr
4Nov 4, 2026 00:4423,5573,543,403,0223,479,037,00054,532,00016,801,792stderr
5Nov 4, 2026 00:4423,5593,543,840,8793,479,275,00054,601,00016,801,792stderr
6Nov 4, 2026 00:4423,5693,544,923,7883,480,648,00054,750,00016,801,792stderr
7Nov 4, 2026 00:4423,6113,551,224,0183,486,501,00055,231,00016,801,792stderr
8Nov 4, 2026 00:4423,6153,552,294,4993,487,027,00055,336,00016,801,792stderr
9Nov 4, 2026 00:4423,6183,552,662,5313,487,598,00055,192,00016,801,792stderr