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 30, 2026 00:27anboto1anboto1Score: 3,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:283,216492,373,667468,664,00013,772,00016,797,696
2Jul 30, 2026 00:283,217492,740,935468,784,00013,779,00016,797,696
3Jul 30, 2026 00:283,217492,703,857468,609,00014,068,00016,797,696
4Jul 30, 2026 00:283,218492,577,421468,981,00013,765,00016,797,696
5Jul 30, 2026 00:283,218492,833,228468,869,00013,868,00016,797,696
6Jul 30, 2026 00:283,221493,135,578469,447,00013,707,00016,797,696
7Jul 30, 2026 00:283,223493,501,897469,663,00013,913,00016,797,696
8Jul 30, 2026 00:283,224493,573,779469,926,00013,769,00016,797,696
9Jul 30, 2026 00:283,236495,308,408471,506,00013,946,00016,797,696