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 24, 2026 10:41anboto1anboto1Score: 25,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:4225,1023,774,442,3703,744,559,00020,742,00016,793,600
2Jun 24, 2026 10:4225,1183,777,240,4573,746,756,00021,042,00016,793,600
3Jun 24, 2026 10:4225,1913,788,017,2663,758,301,00020,361,00016,793,600
4Jun 24, 2026 10:4225,2303,793,843,4173,764,104,00020,543,00016,793,600
5Jun 24, 2026 10:4225,2963,803,743,4963,773,405,00021,005,00016,793,600
6Jun 24, 2026 10:4225,3103,805,791,3953,775,527,00020,989,00016,793,600
7Jun 24, 2026 10:4228,0334,214,277,9904,183,427,00021,573,00016,793,600
8Jun 24, 2026 10:4228,3814,266,578,0384,235,409,00021,881,00016,793,600
9Jun 24, 2026 10:4228,6544,307,425,9274,276,285,00021,904,00016,793,600