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:37Victor MerckléVictor MerckléScore: 1,681Success
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:381,677260,726,467244,016,0007,668,00016,797,696
2Jun 12, 2026 07:381,679260,962,888244,180,0007,725,00016,797,696
3Jun 12, 2026 07:381,679261,056,698244,267,0007,686,00016,797,696
4Jun 12, 2026 07:381,680261,238,053244,469,0007,663,00016,797,696
5Jun 12, 2026 07:381,681261,813,636244,366,0007,889,00016,797,696
6Jun 12, 2026 07:381,681261,761,846244,331,0007,833,00016,797,696
7Jun 12, 2026 07:381,683261,631,020244,740,0007,723,00016,797,696
8Jun 12, 2026 07:381,684261,847,705244,930,0007,813,00016,797,696
9Jun 12, 2026 07:381,685261,962,211245,072,0007,806,00016,797,696