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 10:40anboto1anboto1Score: 4,594Success
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 10:414,579696,199,778662,120,00024,842,00016,793,600
2Jun 24, 2026 10:414,588697,441,011662,906,00025,313,00016,793,600
3Jun 24, 2026 10:414,591697,928,396663,771,00024,897,00016,793,600
4Jun 24, 2026 10:414,594698,353,053664,034,00025,204,00016,793,600
5Jun 24, 2026 10:414,594698,501,750664,164,00025,057,00016,793,600
6Jun 24, 2026 10:414,596698,671,409663,736,00025,730,00016,793,600
7Jun 24, 2026 10:414,596698,692,730663,828,00025,613,00016,793,600
8Jun 24, 2026 10:414,598698,901,294664,180,00025,647,00016,793,600
9Jun 24, 2026 10:414,602699,909,480664,873,00025,453,00016,793,600