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 15:25anboto1anboto1Score: 5,312Success
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 15:265,298804,885,234786,247,0008,551,00016,793,600
2Jul 29, 2026 15:265,307807,294,702787,608,0008,542,00016,793,600
3Jul 29, 2026 15:265,311806,683,780788,295,0008,398,00016,793,600
4Jul 29, 2026 15:265,311806,649,876788,243,0008,409,00016,793,600
5Jul 29, 2026 15:265,312807,044,642788,294,0008,573,00016,793,600
6Jul 29, 2026 15:265,315807,375,780788,567,0008,709,00016,793,600
7Jul 29, 2026 15:265,376816,509,205797,814,0008,589,00016,793,600
8Jul 29, 2026 15:265,381817,543,109798,625,0008,614,00016,793,600
9Jul 29, 2026 15:265,406821,043,930802,474,0008,496,00016,793,600