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 17:28Andrew EpsteinAndrew EpsteinScore: 12,806Success
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 17:3012,8021,930,797,8671,881,191,00039,161,00016,801,792stderr
2Sep 21, 2026 17:3012,8021,930,715,8451,880,296,00040,038,00016,801,792stderr
3Sep 21, 2026 17:3012,8031,932,297,3421,880,586,00040,004,00016,801,792stderr
4Sep 21, 2026 17:3012,8031,930,924,8531,880,674,00039,868,00016,801,792stderr
5Sep 21, 2026 17:3012,8061,931,286,8671,880,932,00040,001,00016,801,792stderr
6Sep 21, 2026 17:3012,8061,931,436,9561,881,024,00039,959,00016,801,792stderr
7Sep 21, 2026 17:3012,8321,935,290,2331,884,784,00040,146,00016,801,792stderr
8Sep 21, 2026 17:3012,8331,935,342,2101,884,792,00040,211,00016,801,792stderr
9Sep 21, 2026 17:3012,8361,936,552,7521,885,188,00040,239,00016,801,792stderr