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 14:35anboto1anboto1Score: 3,115Success
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 14:363,105475,052,214440,618,00025,214,00016,793,600
2Jun 24, 2026 14:363,111475,906,683441,275,00025,443,00016,793,600
3Jun 24, 2026 14:363,111475,967,454440,282,00026,486,00016,793,600
4Jun 24, 2026 14:363,113476,108,989441,125,00025,842,00016,793,600
5Jun 24, 2026 14:363,115476,908,487442,303,00025,077,00016,793,600
6Jun 24, 2026 14:363,117476,783,008440,504,00027,122,00016,793,600
7Jun 24, 2026 14:363,117476,755,377442,029,00025,616,00016,793,600
8Jun 24, 2026 14:363,119476,980,511441,905,00026,004,00016,793,600
9Jun 24, 2026 14:363,119477,217,535442,302,00025,579,00016,793,600