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 listApr 26, 2026 15:30Victor MerckléVictor MerckléScore: 3,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:313,860593,221,041571,034,0008,000,00017,068,032
2Apr 26, 2026 15:313,860595,286,776571,015,0008,000,00017,108,992
3Apr 26, 2026 15:313,861600,886,801571,194,0008,002,00017,092,608
4Apr 26, 2026 15:313,862600,311,444572,446,0006,993,00017,039,360
5Apr 26, 2026 15:313,862596,814,261571,365,0007,991,00017,051,648
6Apr 26, 2026 15:313,863598,992,721571,472,0007,992,00017,104,896
7Apr 26, 2026 15:313,863599,443,444572,544,0006,994,00017,039,360
8Apr 26, 2026 15:313,863593,269,751572,468,0006,993,00017,170,432
9Apr 26, 2026 15:313,864602,951,834572,641,0006,995,00017,113,088