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:11anboto1anboto1Score: 3,112Success
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:113,107475,284,745440,558,00025,526,00016,793,600
2Jun 24, 2026 14:113,107475,423,150440,640,00025,509,00016,793,600
3Jun 24, 2026 14:113,108475,672,012440,417,00025,807,00016,793,600
4Jun 24, 2026 14:113,112476,070,551441,228,00025,613,00016,793,600
5Jun 24, 2026 14:113,112475,995,063441,146,00025,720,00016,793,600
6Jun 24, 2026 14:113,118476,855,611442,273,00025,472,00016,793,600
7Jun 24, 2026 14:113,118477,038,901441,805,00025,988,00016,793,600
8Jun 24, 2026 14:113,123477,695,946443,026,00025,538,00016,793,600
9Jun 24, 2026 14:113,124477,797,771442,848,00025,867,00016,793,600