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:30anboto1anboto1Score: 3,156Success
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:313,151481,927,785447,759,00025,033,00016,793,600
2Jun 24, 2026 12:313,154482,347,522448,205,00024,957,00016,793,600
3Jun 24, 2026 12:313,154482,282,556448,447,00024,684,00016,793,600
4Jun 24, 2026 12:313,156482,623,586448,483,00025,013,00016,793,600
5Jun 24, 2026 12:313,156482,707,780447,857,00025,682,00016,793,600
6Jun 24, 2026 12:313,161483,566,547448,716,00025,557,00016,793,600
7Jun 24, 2026 12:313,167484,209,525450,356,00024,761,00016,793,600
8Jun 24, 2026 12:313,167484,767,368450,164,00025,034,00016,793,600
9Jun 24, 2026 12:313,172484,900,683450,764,00025,039,00016,793,600