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:13anboto1anboto1Score: 3,101Success
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:143,095473,507,222439,546,00024,706,00016,793,600
2Jun 24, 2026 14:143,095473,448,700439,103,00025,158,00016,793,600
3Jun 24, 2026 14:143,097473,782,379439,044,00025,556,00016,793,600
4Jun 24, 2026 14:143,100474,646,860439,684,00025,411,00016,793,600
5Jun 24, 2026 14:143,101474,404,078439,665,00025,489,00016,793,600
6Jun 24, 2026 14:143,104474,899,926440,139,00025,579,00016,793,600
7Jun 24, 2026 14:143,109475,425,882440,834,00025,529,00016,793,600
8Jun 24, 2026 14:143,111475,723,663440,847,00025,811,00016,793,600
9Jun 24, 2026 14:143,117476,616,666441,534,00026,033,00016,793,600