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 16:15anboto1anboto1Score: 3,855Success
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 16:153,847587,254,551570,196,0006,930,00016,793,600
2Jul 29, 2026 16:153,847587,190,227570,257,0006,897,00016,793,600
3Jul 29, 2026 16:153,850587,700,714570,665,0006,940,00016,793,600
4Jul 29, 2026 16:153,854588,350,865571,283,0006,918,00016,793,600
5Jul 29, 2026 16:153,855588,389,336571,356,0006,912,00016,793,600
6Jul 29, 2026 16:153,860589,167,888572,131,0006,974,00016,793,600
7Jul 29, 2026 16:153,860589,132,978572,191,0006,924,00016,793,600
8Jul 29, 2026 16:153,865589,959,735572,908,0006,965,00016,793,600
9Jul 29, 2026 16:153,888593,468,457576,254,0007,011,00016,793,600