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 16:11Victor MerckléVictor MerckléScore: 1,694Success
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 16:131,691261,504,717245,261,0008,496,00016,818,176
2Jun 13, 2026 16:131,691262,252,085245,336,0008,458,00016,818,176
3Jun 13, 2026 16:131,692262,784,793245,390,0008,494,00016,818,176
4Jun 13, 2026 16:131,694263,171,066245,630,0008,594,00016,818,176
5Jun 13, 2026 16:131,694263,135,950245,654,0008,565,00016,818,176
6Jun 13, 2026 16:131,694262,907,897245,621,0008,609,00016,818,176
7Jun 13, 2026 16:131,698262,462,472246,116,0008,603,00016,818,176
8Jun 13, 2026 16:131,698262,503,161246,172,0008,575,00016,818,176
9Jun 13, 2026 16:131,699263,868,356246,258,0008,674,00016,818,176