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 15:14anboto1anboto1Score: 3,012Success
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 15:143,007460,357,142439,131,00012,019,00016,793,600
2Jun 24, 2026 15:143,008460,456,012439,310,00012,006,00016,793,600
3Jun 24, 2026 15:143,008460,403,934439,315,00011,913,00016,793,600
4Jun 24, 2026 15:143,011460,969,792439,910,00011,862,00016,793,600
5Jun 24, 2026 15:143,012461,073,913439,513,00012,404,00016,793,600
6Jun 24, 2026 15:143,015461,472,710440,167,00012,166,00016,793,600
7Jun 24, 2026 15:143,016461,739,410440,320,00012,223,00016,793,600
8Jun 24, 2026 15:143,022462,590,636441,640,00011,733,00016,793,600
9Jun 24, 2026 15:143,097474,087,868452,451,00012,111,00016,793,600