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:39Victor MerckléVictor MerckléScore: 1,663Success
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:401,661256,942,932241,552,0007,738,00016,797,696
2Jun 27, 2026 18:401,661256,766,157241,559,0007,669,00016,797,696
3Jun 27, 2026 18:401,661256,752,444241,490,0007,693,00016,797,696
4Jun 27, 2026 18:401,663257,150,744241,800,0007,758,00016,797,696
5Jun 27, 2026 18:401,663257,179,439241,780,0007,783,00016,797,696
6Jun 27, 2026 18:401,664257,274,731241,833,0007,835,00016,797,696
7Jun 27, 2026 18:401,667257,747,379242,373,0007,789,00016,797,696
8Jun 27, 2026 18:401,667257,650,473242,329,0007,780,00016,797,696
9Jun 27, 2026 18:401,668258,079,697242,459,0007,890,00016,797,696