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 04:02Elijah KinElijah KinScore: 6,907Success
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 04:036,8991,046,005,5941,010,617,00024,245,00016,793,600
2May 30, 2026 04:036,9031,046,523,2041,011,477,00024,010,00016,793,600
3May 30, 2026 04:036,9061,048,142,4801,011,723,00024,181,00016,793,600
4May 30, 2026 04:036,9071,046,124,7941,012,037,00024,137,00016,793,600
5May 30, 2026 04:036,9071,047,034,3801,012,079,00023,980,00016,793,600
6May 30, 2026 04:036,9081,047,855,6741,012,378,00023,891,00016,793,600
7May 30, 2026 04:036,9101,048,035,0961,012,435,00024,210,00016,793,600
8May 30, 2026 04:036,9121,047,143,7141,012,858,00024,030,00016,793,600
9May 30, 2026 04:036,9201,048,139,8331,014,240,00023,823,00016,793,600