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:17anboto1anboto1Score: 3,139Success
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:173,135479,512,031442,544,00027,751,00016,793,600
2Jun 24, 2026 13:173,138479,991,116442,846,00027,983,00016,793,600
3Jun 24, 2026 13:173,138479,921,468442,493,00028,264,00016,793,600
4Jun 24, 2026 13:173,139480,074,888442,813,00028,050,00016,793,600
5Jun 24, 2026 13:173,139480,184,210443,303,00027,674,00016,793,600
6Jun 24, 2026 13:173,141480,277,996443,737,00027,434,00016,793,600
7Jun 24, 2026 13:173,142481,810,444444,309,00027,005,00016,793,600
8Jun 24, 2026 13:173,152482,006,791445,795,00027,068,00016,793,600
9Jun 24, 2026 13:173,155482,374,474445,415,00027,855,00016,793,600