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:58Elijah KinElijah KinScore: 5,225Success
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:585,222793,288,570759,495,00023,869,00016,793,600
2May 30, 2026 03:585,223793,087,651759,628,00023,856,00016,793,600
3May 30, 2026 03:585,223794,571,725759,645,00023,856,00016,793,600
4May 30, 2026 03:585,224795,180,618759,620,00024,040,00016,793,600
5May 30, 2026 03:585,225795,366,450760,441,00023,447,00016,793,600
6May 30, 2026 03:585,227795,494,932760,390,00023,806,00016,793,600
7May 30, 2026 03:585,229794,581,982760,372,00024,096,00016,793,600
8May 30, 2026 03:585,241796,400,141762,613,00023,682,00016,793,600
9May 30, 2026 03:585,718868,901,283833,346,00024,466,00016,793,600