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 listJun 24, 2026 13:33anboto1anboto1Score: 3,126Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 13:333,120477,408,325441,820,00026,213,00016,793,600
2Jun 24, 2026 13:333,123477,676,137443,036,00025,515,00016,793,600
3Jun 24, 2026 13:333,123477,686,655442,520,00026,056,00016,793,600
4Jun 24, 2026 13:333,125477,913,656442,913,00025,852,00016,793,600
5Jun 24, 2026 13:333,126478,581,500442,891,00026,085,00016,793,600
6Jun 24, 2026 13:333,127478,285,010441,947,00027,198,00016,793,600
7Jun 24, 2026 13:333,131478,779,731443,553,00026,131,00016,793,600
8Jun 24, 2026 13:333,132478,974,134444,695,00025,192,00016,793,600
9Jun 24, 2026 13:333,132479,118,716444,629,00025,319,00016,793,600