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 08:02Victor MerckléVictor MerckléScore: 1,683Success
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 08:031,681261,452,251244,553,0007,731,00016,797,696
2Jun 12, 2026 08:031,681261,294,342244,466,0007,731,00016,797,696
3Jun 12, 2026 08:031,682261,561,244244,596,0007,801,00016,797,696
4Jun 12, 2026 08:031,683261,785,042244,803,0007,666,00016,797,696
5Jun 12, 2026 08:031,683261,665,165244,813,0007,728,00016,797,696
6Jun 12, 2026 08:031,683261,579,209244,721,0007,764,00016,797,696
7Jun 12, 2026 08:031,687262,121,992245,306,0007,774,00016,797,696
8Jun 12, 2026 08:031,688262,473,033245,510,0007,809,00016,797,696
9Jun 12, 2026 08:031,690262,773,279245,690,0007,917,00016,797,696