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 listMay 5, 2026 10:25Victor MerckléVictor MerckléScore: 1,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 10:261,881298,086,435272,871,0009,330,00017,158,144
2May 5, 2026 10:261,885301,199,826273,611,0009,191,00017,158,144
3May 5, 2026 10:261,891300,351,888274,230,0009,490,00017,141,760
4May 5, 2026 10:261,892302,052,726274,355,0009,543,00017,154,048
5May 5, 2026 10:261,893299,584,113274,423,0009,527,00017,162,240
6May 5, 2026 10:261,895302,828,853274,846,0009,427,00017,149,952
7May 5, 2026 10:261,896303,891,521274,985,0009,558,00017,154,048
8May 5, 2026 10:261,961310,835,520284,935,0009,353,00017,145,856
9May 5, 2026 10:261,963313,011,952284,995,0009,552,00017,145,856