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 23:00anboto1anboto1Score: 2,965Success
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 23:042,961454,281,485429,299,00014,919,00016,793,600
2Jul 29, 2026 23:042,963455,058,011429,499,00015,048,00016,793,600
3Jul 29, 2026 23:042,964455,270,974429,771,00014,909,00016,793,600
4Jul 29, 2026 23:042,964454,684,106429,675,00015,029,00016,793,600
5Jul 29, 2026 23:042,965454,767,847429,722,00015,110,00016,793,600
6Jul 29, 2026 23:042,965455,341,455429,800,00015,021,00016,793,600
7Jul 29, 2026 23:042,966454,888,300429,859,00015,141,00016,793,600
8Jul 29, 2026 23:042,972455,858,626430,833,00015,085,00016,793,600
9Jul 29, 2026 23:042,998459,748,154434,645,00015,100,00016,793,600