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 22:11anboto1anboto1Score: 3,884Success
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 22:113,871590,778,356565,704,00015,087,00016,793,600
2Jul 29, 2026 22:113,871590,871,037565,706,00015,058,00016,793,600
3Jul 29, 2026 22:113,876591,609,132566,410,00015,120,00016,793,600
4Jul 29, 2026 22:113,883592,507,605567,372,00015,115,00016,793,600
5Jul 29, 2026 22:113,884592,557,691567,503,00015,097,00016,793,600
6Jul 29, 2026 22:113,889593,436,197568,344,00015,110,00016,793,600
7Jul 29, 2026 22:113,894594,190,240568,890,00015,225,00016,793,600
8Jul 29, 2026 22:113,896594,461,569569,412,00015,108,00016,793,600
9Jul 29, 2026 22:113,900595,130,951569,975,00015,078,00016,793,600