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 11:41anboto1anboto1Score: 4,052Success
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 11:424,049616,558,537588,399,00019,054,00016,793,600
2Jun 24, 2026 11:424,052617,206,884589,085,00018,864,00016,793,600
3Jun 24, 2026 11:424,052618,500,881588,806,00019,028,00016,793,600
4Jun 24, 2026 11:424,052617,161,914588,863,00019,032,00016,793,600
5Jun 24, 2026 11:424,052617,005,763588,588,00019,333,00016,793,600
6Jun 24, 2026 11:424,057617,746,792589,253,00019,343,00016,793,600
7Jun 24, 2026 11:424,057618,930,947589,247,00019,349,00016,793,600
8Jun 24, 2026 11:424,059618,111,844589,506,00019,431,00016,793,600
9Jun 24, 2026 11:424,065619,140,058590,611,00019,197,00016,793,600