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 listOct 15, 2026 22:58izotoffizotoffScore: 2,113Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 23:002,099326,406,803305,141,0009,828,00016,818,176
2Oct 15, 2026 23:002,100326,365,496305,825,0009,258,00016,818,176
3Oct 15, 2026 23:002,102325,957,263305,417,0009,884,00016,818,176
4Oct 15, 2026 23:002,110328,224,661307,033,0009,552,00016,818,176
5Oct 15, 2026 23:002,113330,434,171307,812,0009,261,00016,818,176
6Oct 15, 2026 23:002,116329,035,335307,795,0009,675,00016,818,176
7Oct 15, 2026 23:002,117332,220,454308,109,0009,450,00016,818,176
8Oct 15, 2026 23:002,125330,369,948309,543,0009,230,00016,818,176
9Oct 15, 2026 23:002,128330,748,621308,829,00010,397,00016,818,176