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 listJun 24, 2026 09:43anboto1anboto1Score: 13,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 09:4313,1171,977,354,6461,912,926,00054,724,00017,448,960
2Jun 24, 2026 09:4313,2281,994,041,8811,926,108,00058,158,00017,444,864
3Jun 24, 2026 09:4313,2421,996,129,8531,932,971,00053,430,00017,604,608
4Jun 24, 2026 09:4313,2551,998,139,0591,930,223,00058,160,00017,526,784
5Jun 24, 2026 09:4313,2682,000,490,4821,932,707,00057,639,00017,141,760
6Jun 24, 2026 09:4313,5162,040,948,3991,969,786,00057,652,00017,784,832
7Jun 24, 2026 09:4314,0612,118,495,3072,057,358,00051,810,00017,444,864
8Jun 24, 2026 09:4314,0882,122,729,1572,060,703,00052,646,00017,465,344
9Jun 24, 2026 09:4314,0882,122,528,9732,057,011,00056,203,00017,518,592