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:18izotoffizotoffScore: 4,366Success
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 22:214,364666,389,940644,564,00010,092,00016,818,176
2Oct 15, 2026 22:214,365666,800,309645,269,0009,548,00016,818,176
3Oct 15, 2026 22:214,365666,467,078644,996,0009,832,00016,818,176
4Oct 15, 2026 22:214,366666,795,310644,991,0009,972,00016,818,176
5Oct 15, 2026 22:214,366666,330,334645,214,0009,781,00016,818,176
6Oct 15, 2026 22:214,367667,026,318645,390,0009,809,00016,818,176
7Oct 15, 2026 22:214,367666,845,042645,240,0009,848,00016,818,176
8Oct 15, 2026 22:214,368666,853,007645,179,00010,135,00016,818,176
9Oct 15, 2026 22:214,369668,822,740645,513,0009,862,00016,818,176