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 10:46anboto1anboto1Score: 4,424Success
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 10:474,380666,348,184636,261,00020,884,00016,793,600
2Jun 24, 2026 10:474,411671,465,814640,933,00020,827,00016,793,600
3Jun 24, 2026 10:474,413671,292,542641,456,00020,561,00016,793,600
4Jun 24, 2026 10:474,421672,454,381642,694,00020,547,00016,793,600
5Jun 24, 2026 10:474,424672,931,669642,713,00020,988,00016,793,600
6Jun 24, 2026 10:474,426673,160,287643,039,00020,943,00016,793,600
7Jun 24, 2026 10:474,427673,264,475642,988,00021,157,00016,793,600
8Jun 24, 2026 10:474,468679,527,142649,613,00020,652,00016,793,600
9Jun 24, 2026 10:474,471679,870,442649,751,00020,918,00016,793,600