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 22:24anboto1anboto1Score: 2,896Success
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 22:252,894444,070,115420,932,00013,214,00016,793,600
2Jul 29, 2026 22:252,895444,332,119421,057,00013,199,00016,793,600
3Jul 29, 2026 22:252,895444,298,593421,033,00013,267,00016,793,600
4Jul 29, 2026 22:252,896444,540,073421,187,00013,266,00016,793,600
5Jul 29, 2026 22:252,896444,490,963421,265,00013,265,00016,793,600
6Jul 29, 2026 22:252,896444,453,025421,225,00013,259,00016,793,600
7Jul 29, 2026 22:252,899444,887,807421,788,00013,179,00016,793,600
8Jul 29, 2026 22:252,900444,989,917421,716,00013,391,00016,793,600
9Jul 29, 2026 22:252,902446,540,221422,077,00013,336,00016,793,600