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 listJul 2, 2026 10:42A_ShamanA_ShamanScore: 3,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 10:423,986607,472,125575,450,00022,537,00016,793,600
2Jul 2, 2026 10:423,987607,612,600575,113,00023,052,00016,793,600
3Jul 2, 2026 10:423,987607,557,227575,144,00023,022,00016,793,600
4Jul 2, 2026 10:423,988607,774,250575,339,00022,946,00016,793,600
5Jul 2, 2026 10:423,990608,261,202576,201,00022,439,00016,793,600
6Jul 2, 2026 10:423,990608,196,293575,351,00023,294,00016,793,600
7Jul 2, 2026 10:423,990608,072,894576,036,00022,555,00016,793,600
8Jul 2, 2026 10:423,992608,419,551576,179,00022,749,00016,793,600
9Jul 2, 2026 10:424,005610,320,729577,642,00023,238,00016,793,600