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 06:41Victor MerckléVictor MerckléScore: 1,700Success
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 06:421,697263,638,040246,954,0007,641,00016,797,696
2Jun 12, 2026 06:421,697263,754,458246,758,0007,793,00016,797,696
3Jun 12, 2026 06:421,697264,149,875246,879,0007,763,00016,797,696
4Jun 12, 2026 06:421,698263,903,915246,936,0007,872,00016,797,696
5Jun 12, 2026 06:421,700264,240,212247,336,0007,809,00016,797,696
6Jun 12, 2026 06:421,700264,208,053247,275,0007,741,00016,797,696
7Jun 12, 2026 06:421,703264,645,124247,676,0007,828,00016,797,696
8Jun 12, 2026 06:421,704264,795,397247,835,0007,820,00016,797,696
9Jun 12, 2026 06:421,704266,080,459247,843,0007,814,00016,797,696