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 20:34anboto1anboto1Score: 3,908Success
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 20:343,905596,068,745573,143,00012,688,00016,793,600
2Jul 29, 2026 20:343,905596,180,319573,249,00012,650,00016,793,600
3Jul 29, 2026 20:343,906596,994,129573,215,00012,686,00016,793,600
4Jul 29, 2026 20:343,907596,467,275573,298,00012,868,00016,793,600
5Jul 29, 2026 20:343,908596,508,292573,624,00012,648,00016,793,600
6Jul 29, 2026 20:343,909597,174,336573,675,00012,697,00016,793,600
7Jul 29, 2026 20:343,910596,666,582573,805,00012,732,00016,793,600
8Jul 29, 2026 20:343,911596,907,467574,188,00012,563,00016,793,600
9Jul 29, 2026 20:343,911596,906,065573,980,00012,762,00016,793,600