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 30, 2026 03:51Elijah KinElijah KinScore: 4,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:524,962755,601,191720,196,00024,237,00016,793,600
2May 30, 2026 03:524,969754,785,991721,818,00023,664,00016,793,600
3May 30, 2026 03:524,972769,782,376722,100,00023,776,00016,793,600
4May 30, 2026 03:524,988772,175,358724,157,00024,166,00016,793,600
5May 30, 2026 03:524,990758,835,720724,528,00024,034,00016,793,600
6May 30, 2026 03:525,008774,881,694727,618,00023,650,00016,793,600
7May 30, 2026 03:525,009774,026,732727,335,00024,040,00016,793,600
8May 30, 2026 03:525,074781,686,136737,096,00024,107,00016,793,600
9May 30, 2026 03:525,087785,940,144738,649,00024,463,00016,793,600