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 26, 2026 20:22A_ShamanA_ShamanScore: 4,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 20:224,018612,088,879575,663,00027,134,00016,793,600
2Jun 26, 2026 20:224,019612,080,274576,462,00026,395,00016,793,600
3Jun 26, 2026 20:224,021612,423,591575,477,00027,773,00016,793,600
4Jun 26, 2026 20:224,021612,453,649576,038,00027,151,00016,793,600
5Jun 26, 2026 20:224,023612,922,152575,989,00027,609,00016,793,600
6Jun 26, 2026 20:224,025613,005,752577,525,00026,249,00016,793,600
7Jun 26, 2026 20:224,027613,324,757576,502,00027,683,00016,793,600
8Jun 26, 2026 20:224,037614,830,787578,439,00027,129,00016,793,600
9Jun 26, 2026 20:224,110625,740,962589,924,00026,594,00016,793,600