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 17, 2026 14:30Victor MerckléVictor MerckléScore: 1,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 14:311,672260,407,090243,170,0007,669,00016,797,696
2Jun 17, 2026 14:311,672260,632,137243,210,0007,642,00016,797,696
3Jun 17, 2026 14:311,672260,207,735243,151,0007,683,00016,797,696
4Jun 17, 2026 14:311,673260,496,960243,286,0007,768,00016,797,696
5Jun 17, 2026 14:311,673260,093,323243,258,0007,719,00016,797,696
6Jun 17, 2026 14:311,674260,294,945243,431,0007,763,00016,797,696
7Jun 17, 2026 14:311,678261,173,910243,882,0007,844,00016,797,696
8Jun 17, 2026 14:311,678260,876,059244,030,0007,748,00016,797,696
9Jun 17, 2026 14:311,679261,511,928244,161,0007,813,00016,797,696