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 12, 2026 07:17Victor MerckléVictor MerckléScore: 1,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 07:181,690262,737,927245,807,0007,723,00016,797,696
2Jun 12, 2026 07:181,690262,669,082245,859,0007,678,00016,797,696
3Jun 12, 2026 07:181,691263,003,729245,925,0007,750,00016,797,696
4Jun 12, 2026 07:181,692263,308,552245,935,0007,975,00016,797,696
5Jun 12, 2026 07:181,692263,759,543246,072,0007,763,00016,797,696
6Jun 12, 2026 07:181,692263,055,544245,952,0007,921,00016,797,696
7Jun 12, 2026 07:181,696263,604,354246,636,0007,812,00016,797,696
8Jun 12, 2026 07:181,696263,587,954246,576,0007,836,00016,797,696
9Jun 12, 2026 07:181,696263,972,553246,637,0007,841,00016,797,696