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:42Victor MerckléVictor MerckléScore: 1,678Success
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:431,676260,610,230243,728,0007,727,00016,797,696
2Jun 12, 2026 07:431,677260,660,470243,905,0007,706,00016,797,696
3Jun 12, 2026 07:431,678260,826,589243,990,0007,725,00016,797,696
4Jun 12, 2026 07:431,678260,969,615243,894,0007,930,00016,797,696
5Jun 12, 2026 07:431,678261,264,236243,969,0007,801,00016,797,696
6Jun 12, 2026 07:431,678260,862,976244,031,0007,730,00016,797,696
7Jun 12, 2026 07:431,682261,448,089244,626,0007,696,00016,797,696
8Jun 12, 2026 07:431,683261,689,800244,792,0007,767,00016,797,696
9Jun 12, 2026 07:431,683261,709,035244,741,0007,838,00016,797,696