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 listSep 21, 2026 16:53Andrew EpsteinAndrew EpsteinScore: 16,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 16:5416,7132,518,871,6712,457,525,00049,427,00016,801,792stderr
2Sep 21, 2026 16:5416,7132,517,325,7722,458,148,00048,811,00016,801,792stderr
3Sep 21, 2026 16:5416,7142,518,128,8772,458,134,00049,071,00016,801,792stderr
4Sep 21, 2026 16:5416,7152,518,613,4102,457,657,00049,742,00016,801,792stderr
5Sep 21, 2026 16:5416,7162,517,990,3722,457,722,00049,785,00016,801,792stderr
6Sep 21, 2026 16:5416,7182,518,133,9192,458,717,00049,042,00016,801,792stderr
7Sep 21, 2026 16:5416,7592,524,325,7932,464,614,00049,257,00016,801,792stderr
8Sep 21, 2026 16:5416,7622,524,768,7952,465,257,00049,125,00016,801,792stderr
9Sep 21, 2026 16:5416,7662,525,320,2072,464,972,00050,004,00016,801,792stderr