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 12:37anboto1anboto1Score: 3,123Success
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 12:383,107475,342,518441,020,00025,096,00016,793,600
2Jun 24, 2026 12:383,109475,692,949441,002,00025,483,00016,793,600
3Jun 24, 2026 12:383,111475,892,691441,456,00025,294,00016,793,600
4Jun 24, 2026 12:383,114476,363,668441,024,00026,159,00016,793,600
5Jun 24, 2026 12:383,123477,711,063442,413,00026,162,00016,793,600
6Jun 24, 2026 12:383,126478,246,327443,350,00025,693,00016,793,600
7Jun 24, 2026 12:383,126478,056,624443,261,00025,692,00016,793,600
8Jun 24, 2026 12:383,128478,371,950443,225,00026,064,00016,793,600
9Jun 24, 2026 12:383,150481,684,152447,679,00024,893,00016,793,600