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:27anboto1anboto1Score: 3,106Success
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:273,091472,932,634438,556,00025,166,00016,793,600
2Jun 24, 2026 14:273,097473,898,071439,411,00025,253,00016,793,600
3Jun 24, 2026 14:273,098474,037,154439,798,00025,011,00016,793,600
4Jun 24, 2026 14:273,105474,996,370440,375,00025,415,00016,793,600
5Jun 24, 2026 14:273,106475,286,499440,649,00025,397,00016,793,600
6Jun 24, 2026 14:273,115476,497,548442,095,00025,236,00016,793,600
7Jun 24, 2026 14:273,117476,699,375442,114,00025,471,00016,793,600
8Jun 24, 2026 14:273,120477,234,576442,230,00025,891,00016,793,600
9Jun 24, 2026 14:273,177495,661,609451,057,00025,549,00016,793,600