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:51anboto1anboto1Score: 2,792Success
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:522,791428,697,632405,687,00013,083,00016,793,600
2Jul 29, 2026 18:522,791428,753,861405,600,00013,132,00016,793,600
3Jul 29, 2026 18:522,792428,928,362405,808,00013,110,00016,793,600
4Jul 29, 2026 18:522,792429,012,663405,821,00013,093,00016,793,600
5Jul 29, 2026 18:522,792428,997,959405,733,00013,205,00016,793,600
6Jul 29, 2026 18:522,796429,440,317406,369,00013,117,00016,793,600
7Jul 29, 2026 18:522,796429,507,002406,245,00013,183,00016,793,600
8Jul 29, 2026 18:522,802430,570,108407,214,00013,164,00016,793,600
9Jul 29, 2026 18:522,810431,663,236408,059,00013,542,00016,793,600