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:56Andrew EpsteinAndrew EpsteinScore: 23,629Success
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:5823,6143,551,926,1433,487,612,00054,600,00016,801,792stderr
2Nov 4, 2026 00:5823,6203,552,453,9553,488,539,00054,497,00016,801,792stderr
3Nov 4, 2026 00:5823,6223,553,266,3643,488,763,00054,625,00016,801,792stderr
4Nov 4, 2026 00:5823,6243,553,440,8313,488,669,00055,046,00016,801,792stderr
5Nov 4, 2026 00:5823,6293,553,859,0653,489,842,00054,533,00016,801,792stderr
6Nov 4, 2026 00:5823,6293,554,219,1593,489,388,00055,058,00016,801,792stderr
7Nov 4, 2026 00:5823,6713,560,183,5893,495,784,00054,965,00016,801,792stderr
8Nov 4, 2026 00:5823,6813,561,662,9493,497,123,00055,084,00016,801,792stderr
9Nov 4, 2026 00:5823,6823,561,797,9403,497,329,00055,050,00016,801,792stderr