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:32anboto1anboto1Score: 3,111Success
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:323,103474,733,743439,707,00025,792,00016,793,600
2Jun 24, 2026 14:323,105474,979,631439,574,00026,184,00016,793,600
3Jun 24, 2026 14:323,106475,317,388441,521,00024,514,00016,793,600
4Jun 24, 2026 14:323,109475,641,491439,940,00026,527,00016,793,600
5Jun 24, 2026 14:323,111479,729,510440,465,00026,231,00016,793,600
6Jun 24, 2026 14:323,112475,969,572441,593,00025,241,00016,793,600
7Jun 24, 2026 14:323,113476,160,143441,757,00025,198,00016,793,600
8Jun 24, 2026 14:323,113475,988,757441,535,00025,419,00016,793,600
9Jun 24, 2026 14:323,116476,528,594441,771,00025,635,00016,793,600