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 12:27anboto1anboto1Score: 3,114Success
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 12:283,104474,726,649440,662,00024,957,00016,793,600
2Jun 24, 2026 12:283,106475,299,094440,929,00025,080,00016,793,600
3Jun 24, 2026 12:283,111475,952,526441,518,00025,266,00016,793,600
4Jun 24, 2026 12:283,112476,156,141440,950,00025,998,00016,793,600
5Jun 24, 2026 12:283,114476,263,675442,185,00024,932,00016,793,600
6Jun 24, 2026 12:283,115476,479,094441,334,00026,001,00016,793,600
7Jun 24, 2026 12:283,116476,585,071442,107,00025,353,00016,793,600
8Jun 24, 2026 12:283,116476,730,636442,078,00025,465,00016,793,600
9Jun 24, 2026 12:283,120477,268,032442,755,00025,327,00016,793,600