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 24, 2026 12:20anboto1anboto1Score: 3,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 12:213,146481,058,766447,693,00024,213,00016,793,600
2Jun 24, 2026 12:213,150481,623,816447,110,00025,390,00016,793,600
3Jun 24, 2026 12:213,152482,129,966447,522,00025,422,00016,793,600
4Jun 24, 2026 12:213,153482,155,543447,901,00025,062,00016,793,600
5Jun 24, 2026 12:213,154482,218,603447,566,00025,550,00016,793,600
6Jun 24, 2026 12:213,156483,243,027448,867,00024,552,00016,793,600
7Jun 24, 2026 12:213,159482,980,939448,742,00025,167,00016,793,600
8Jun 24, 2026 12:213,160483,084,858449,345,00024,657,00016,793,600
9Jun 24, 2026 12:213,164483,677,682448,945,00025,684,00016,793,600