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 listSep 26, 2026 14:56Kevin HeaveyKevin HeaveyScore: 1,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 14:571,557242,910,222228,968,0004,680,00016,793,600
2Sep 26, 2026 14:571,558242,615,045229,055,0004,667,00016,793,600
3Sep 26, 2026 14:571,558244,432,251229,058,0004,681,00016,793,600
4Sep 26, 2026 14:571,558243,118,726229,012,0004,696,00016,793,600
5Sep 26, 2026 14:571,558242,596,473229,016,0004,695,00016,793,600
6Sep 26, 2026 14:571,561243,194,459229,454,0004,741,00016,793,600
7Sep 26, 2026 14:571,562243,167,222229,663,0004,746,00016,793,600
8Sep 26, 2026 14:571,563244,006,975229,694,0004,763,00016,793,600
9Sep 26, 2026 14:571,570249,570,991230,882,0004,723,00016,793,600