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 18, 2026 19:53Victor 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 18, 2026 19:541,652256,991,989239,972,0007,904,00016,797,696
2Jun 18, 2026 19:541,652256,989,016240,046,0007,891,00016,797,696
3Jun 18, 2026 19:541,652257,074,275240,095,0007,827,00016,797,696
4Jun 18, 2026 19:541,653257,228,307240,084,0007,895,00016,797,696
5Jun 18, 2026 19:541,654257,685,422240,325,0007,908,00016,797,696
6Jun 18, 2026 19:541,654257,232,255240,159,0007,942,00016,797,696
7Jun 18, 2026 19:541,657257,700,277240,697,0007,928,00016,797,696
8Jun 18, 2026 19:541,658257,886,511240,805,0007,947,00016,797,696
9Jun 18, 2026 19:541,658257,926,368240,817,0007,984,00016,797,696