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 27, 2026 18:23Victor MerckléVictor MerckléScore: 1,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 18:291,660257,038,741241,419,0007,718,00016,797,696
2Jun 27, 2026 18:291,662257,189,895241,705,0007,701,00016,797,696
3Jun 27, 2026 18:291,662257,238,127241,620,0007,732,00016,797,696
4Jun 27, 2026 18:291,662257,300,193241,634,0007,782,00016,797,696
5Jun 27, 2026 18:291,662257,330,101241,583,0007,829,00016,797,696
6Jun 27, 2026 18:291,663257,671,060241,742,0007,766,00016,797,696
7Jun 27, 2026 18:291,666258,361,704242,179,0007,737,00016,797,696
8Jun 27, 2026 18:291,667257,894,325242,277,0007,824,00016,797,696
9Jun 27, 2026 18:291,668258,181,936242,459,0007,839,00016,797,696