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 listFeb 16, 2026 18:27Valentin KofmanValentin KofmanScore: 3,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:273,922620,753,831577,360,00010,987,00016,965,632
2Feb 16, 2026 18:273,934617,795,651582,122,0008,001,00017,108,992
3Feb 16, 2026 18:273,934613,772,559579,124,00011,002,00017,166,336