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:04anboto1anboto1Score: 2,863Success
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:052,861439,223,419416,135,00013,083,00016,793,600
2Jul 29, 2026 23:052,862439,224,321416,117,00013,214,00016,793,600
3Jul 29, 2026 23:052,862441,631,069416,147,00013,185,00016,793,600
4Jul 29, 2026 23:052,862439,436,678416,257,00013,145,00016,793,600
5Jul 29, 2026 23:052,863439,630,073416,194,00013,294,00016,793,600
6Jul 29, 2026 23:052,863441,847,071416,337,00013,186,00016,793,600
7Jul 29, 2026 23:052,866440,019,059416,770,00013,222,00016,793,600
8Jul 29, 2026 23:052,866440,056,588416,787,00013,232,00016,793,600
9Jul 29, 2026 23:052,908455,973,267422,909,00013,417,00016,793,600