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 listMay 5, 2026 17:44Hung T.NguyenHung T.NguyenScore: 7,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 17:457,5841,155,739,7641,113,396,00024,303,00017,203,200
2May 5, 2026 17:457,6781,170,520,3361,127,539,00024,226,00017,125,376
3May 5, 2026 17:457,7741,184,205,0471,139,581,00026,565,00017,190,912