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 18, 2026 12:04Victor MerckléVictor MerckléScore: 1,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 12:051,672260,027,963241,688,0009,241,00016,797,696
2Jun 18, 2026 12:051,673261,459,166241,776,0009,311,00016,797,696
3Jun 18, 2026 12:051,673260,083,269241,646,0009,334,00016,797,696
4Jun 18, 2026 12:051,673260,224,110241,755,0009,319,00016,797,696
5Jun 18, 2026 12:051,675260,489,896242,004,0009,286,00016,797,696
6Jun 18, 2026 12:051,675260,438,030241,952,0009,326,00016,797,696
7Jun 18, 2026 12:051,679261,089,247242,563,0009,344,00016,797,696
8Jun 18, 2026 12:051,679262,746,709242,196,0009,755,00016,797,696
9Jun 18, 2026 12:051,680261,216,855242,635,0009,387,00016,797,696