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 13:02anboto1anboto1Score: 3,116Success
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 13:023,109475,524,736440,626,00025,780,00016,793,600
2Jun 24, 2026 13:023,110475,809,332440,720,00025,908,00016,793,600
3Jun 24, 2026 13:023,114476,279,692442,038,00025,136,00016,793,600
4Jun 24, 2026 13:023,114476,445,622441,179,00026,059,00016,793,600
5Jun 24, 2026 13:023,116476,626,393441,646,00025,863,00016,793,600
6Jun 24, 2026 13:023,116476,609,593441,888,00025,578,00016,793,600
7Jun 24, 2026 13:023,118476,881,276442,743,00025,052,00016,793,600
8Jun 24, 2026 13:023,123477,693,264442,066,00026,464,00016,793,600
9Jun 24, 2026 13:023,124477,990,857442,801,00025,856,00016,793,600