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 19, 2026 04:46Victor MerckléVictor MerckléScore: 1,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 04:471,648256,446,495239,480,0007,834,00016,797,696
2Jun 19, 2026 04:471,649256,559,125239,671,0007,799,00016,797,696
3Jun 19, 2026 04:471,649256,565,452239,570,0007,810,00016,797,696
4Jun 19, 2026 04:471,649256,636,847239,668,0007,812,00016,797,696
5Jun 19, 2026 04:471,650256,680,498239,647,0007,920,00016,797,696
6Jun 19, 2026 04:471,651256,820,894239,757,0007,903,00016,797,696
7Jun 19, 2026 04:471,654257,311,853240,307,0007,911,00016,797,696
8Jun 19, 2026 04:471,656257,548,395240,542,0007,912,00016,797,696
9Jun 19, 2026 04:471,656257,584,098240,460,0007,979,00016,797,696