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 listMar 4, 2026 20:42olliecrowolliecrowScore: 3,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 20:423,631575,849,322532,647,00011,992,00016,998,400
2Mar 4, 2026 20:423,632573,473,839520,849,00023,993,00016,957,440
3Mar 4, 2026 20:423,632572,298,906528,865,00015,995,00017,125,376
4Mar 4, 2026 20:423,634569,151,065525,048,00020,001,00017,141,760
5Mar 4, 2026 20:423,634570,771,490528,072,00017,002,00017,055,744
6Mar 4, 2026 20:423,635569,379,218527,188,00018,006,00016,953,344
7Mar 4, 2026 20:423,635582,279,033527,216,00018,007,00017,178,624
8Mar 4, 2026 20:423,635571,154,741520,236,00025,011,00017,137,664
9Mar 4, 2026 20:423,635580,026,182525,244,00020,009,00016,973,824