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 08:06Charles CabergsCharles CabergsScore: 3,892Success
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 08:073,888598,063,132571,327,00012,006,00017,031,168
2Apr 26, 2026 08:073,889600,881,904567,407,00016,011,00016,990,208
3Apr 26, 2026 08:073,889598,209,588572,463,00010,989,00017,027,072
4Apr 26, 2026 08:073,889603,417,690568,461,00014,985,00017,035,264
5Apr 26, 2026 08:073,892607,619,423569,831,00013,995,00017,031,168
6Apr 26, 2026 08:073,897601,960,973568,660,00015,990,00017,027,072
7Apr 26, 2026 08:073,909604,794,332572,342,00014,008,00017,035,264
8Apr 26, 2026 08:073,911603,167,616569,732,00016,992,00017,027,072
9Apr 26, 2026 08:073,911604,513,266573,728,00012,993,00017,031,168