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 12:36Victor MerckléVictor MerckléScore: 1,654Success
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 12:381,652256,990,619240,020,0007,839,00016,797,696
2Jun 19, 2026 12:381,653257,266,963240,174,0007,913,00016,797,696
3Jun 19, 2026 12:381,653257,152,791240,107,0007,884,00016,797,696
4Jun 19, 2026 12:381,653257,092,207240,129,0007,872,00016,797,696
5Jun 19, 2026 12:381,654257,286,855240,305,0007,902,00016,797,696
6Jun 19, 2026 12:381,656257,786,722240,267,0008,166,00016,797,696
7Jun 19, 2026 12:381,657257,727,678240,783,0007,887,00016,797,696
8Jun 19, 2026 12:381,658257,878,247240,882,0007,896,00016,797,696
9Jun 19, 2026 12:381,661259,537,145241,202,0008,041,00016,797,696