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 14:56anboto1anboto1Score: 3,017Success
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 14:573,006460,258,131439,132,00011,820,00016,793,600
2Jun 24, 2026 14:573,007460,369,816438,827,00012,335,00016,793,600
3Jun 24, 2026 14:573,010460,787,043439,818,00011,800,00016,793,600
4Jun 24, 2026 14:573,015461,559,341440,823,00011,524,00016,793,600
5Jun 24, 2026 14:573,017461,685,167441,015,00011,552,00016,793,600
6Jun 24, 2026 14:573,019462,164,305441,147,00011,815,00016,793,600
7Jun 24, 2026 14:573,073470,218,350449,824,00011,182,00016,793,600
8Jun 24, 2026 14:573,261498,325,712477,623,00011,561,00016,793,600
9Jun 24, 2026 14:573,985607,066,550586,317,00011,536,00016,793,600