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 29, 2026 22:53anboto1anboto1Score: 2,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 22:532,875441,342,149418,236,00013,080,00016,793,600
2Jul 29, 2026 22:532,876441,588,475418,383,00013,093,00016,793,600
3Jul 29, 2026 22:532,876441,550,473418,370,00013,151,00016,793,600
4Jul 29, 2026 22:532,877441,614,069418,393,00013,219,00016,793,600
5Jul 29, 2026 22:532,878442,320,934418,652,00013,141,00016,793,600
6Jul 29, 2026 22:532,879441,839,054418,635,00013,259,00016,793,600
7Jul 29, 2026 22:532,879442,121,092418,710,00013,210,00016,793,600
8Jul 29, 2026 22:532,880442,087,580418,853,00013,231,00016,793,600
9Jul 29, 2026 22:532,881442,179,126419,072,00013,172,00016,793,600