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 18, 2026 12:44Victor MerckléVictor MerckléScore: 1,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 12:451,650256,742,391239,771,0007,823,00016,797,696
2Jun 18, 2026 12:451,652256,981,092239,994,0007,903,00016,797,696
3Jun 18, 2026 12:451,653257,440,647240,054,0007,962,00016,797,696
4Jun 18, 2026 12:451,655257,477,598240,235,0008,055,00016,797,696
5Jun 18, 2026 12:451,655257,459,103240,144,0008,174,00016,797,696
6Jun 18, 2026 12:451,656257,702,308240,617,0007,930,00016,797,696
7Jun 18, 2026 12:451,656257,625,038240,365,0008,115,00016,797,696
8Jun 18, 2026 12:451,658257,927,036240,785,0007,980,00016,797,696
9Jun 18, 2026 12:451,659258,133,988241,008,0007,909,00016,797,696