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 listJul 29, 2026 23:51anboto1anboto1Score: 2,845Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 23:522,844436,600,739413,227,00013,449,00016,793,600
2Jul 29, 2026 23:522,844436,611,109413,265,00013,395,00016,793,600
3Jul 29, 2026 23:522,844436,686,686413,247,00013,479,00016,793,600
4Jul 29, 2026 23:522,845436,861,913413,297,00013,534,00016,793,600
5Jul 29, 2026 23:522,845436,781,358413,175,00013,580,00016,797,696
6Jul 29, 2026 23:522,845436,777,943413,282,00013,504,00016,793,600
7Jul 29, 2026 23:522,848437,552,494413,836,00013,397,00016,793,600
8Jul 29, 2026 23:522,849437,463,649413,791,00013,620,00016,793,600
9Jul 29, 2026 23:522,849437,403,416413,928,00013,551,00016,793,600