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 13, 2026 02:04Victor MerckléVictor MerckléScore: 1,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 02:071,681261,334,392244,018,0008,265,00016,814,080
2Jun 13, 2026 02:071,681261,243,480243,986,0008,189,00016,809,984
3Jun 13, 2026 02:071,681261,278,071243,947,0008,250,00016,814,080
4Jun 13, 2026 02:071,682261,360,247243,216,0009,136,00016,830,464
5Jun 13, 2026 02:071,683261,483,774244,146,0008,337,00016,809,984
6Jun 13, 2026 02:071,683261,581,142244,258,0008,292,00016,809,984
7Jun 13, 2026 02:071,686261,852,031243,734,0009,180,00016,936,960
8Jun 13, 2026 02:071,686261,908,053243,768,0009,244,00016,936,960
9Jun 13, 2026 02:071,689262,429,153245,052,0008,314,00016,809,984