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:29anboto1anboto1Score: 3,104Success
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:303,097473,897,677438,776,00025,922,00016,793,600
2Jun 24, 2026 14:303,099474,174,660439,078,00025,856,00016,793,600
3Jun 24, 2026 14:303,100474,644,889439,204,00025,937,00016,793,600
4Jun 24, 2026 14:303,102474,549,295439,143,00026,287,00016,793,600
5Jun 24, 2026 14:303,104474,692,628439,684,00025,991,00016,793,600
6Jun 24, 2026 14:303,105474,911,257440,245,00025,554,00016,793,600
7Jun 24, 2026 14:303,110475,714,863440,868,00025,700,00016,793,600
8Jun 24, 2026 14:303,114477,579,198441,443,00025,719,00016,793,600
9Jun 24, 2026 14:303,172485,005,281451,124,00024,706,00016,793,600