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:36anboto1anboto1Score: 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 13:373,108475,440,707441,170,00025,123,00016,793,600
2Jun 24, 2026 13:373,111475,706,586440,911,00025,761,00016,793,600
3Jun 24, 2026 13:373,112476,152,108440,676,00026,227,00016,793,600
4Jun 24, 2026 13:373,113476,539,963441,282,00025,678,00016,793,600
5Jun 24, 2026 13:373,115476,434,888441,113,00026,166,00016,793,600
6Jun 24, 2026 13:373,115476,675,117441,276,00026,103,00016,793,600
7Jun 24, 2026 13:373,121477,276,003443,232,00024,924,00016,793,600
8Jun 24, 2026 13:373,121477,344,614442,799,00025,369,00016,793,600
9Jun 24, 2026 13:373,121477,288,059442,324,00025,833,00016,793,600