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 5, 2026 07:50DanielDanielScore: 3,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 07:503,973622,924,804581,989,00013,999,00017,047,552
2Mar 5, 2026 07:503,974623,000,866584,134,00012,002,00017,166,336
3Mar 5, 2026 07:503,974620,940,867584,139,00012,002,00017,014,784
4Mar 5, 2026 07:503,976621,804,969584,324,00012,006,00017,039,360
5Mar 5, 2026 07:503,976623,219,768585,339,00011,006,00017,113,088
6Mar 5, 2026 07:503,976625,045,522578,479,00017,983,00017,203,200
7Mar 5, 2026 07:503,979623,609,966587,895,0008,998,00017,027,072
8Mar 5, 2026 07:503,980619,038,604581,959,00014,998,00016,953,344
9Mar 5, 2026 07:503,981625,428,985588,093,0009,001,00016,990,208