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 18:07anboto1anboto1Score: 2,793Success
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 18:082,790428,506,020405,473,00013,126,00016,793,600
2Jul 29, 2026 18:082,790428,644,084405,492,00013,091,00016,793,600
3Jul 29, 2026 18:082,791428,763,981405,547,00013,177,00016,793,600
4Jul 29, 2026 18:082,792428,966,020405,805,00013,135,00016,793,600
5Jul 29, 2026 18:082,793429,118,728405,911,00013,148,00016,793,600
6Jul 29, 2026 18:082,794429,012,834405,979,00013,147,00016,793,600
7Jul 29, 2026 18:082,795429,380,260406,108,00013,180,00016,793,600
8Jul 29, 2026 18:082,795429,299,567406,179,00013,150,00016,793,600
9Jul 29, 2026 18:082,798429,707,957406,560,00013,183,00016,793,600