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 listSep 4, 2026 08:19Victor MerckléVictor MerckléScore: 1,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 08:311,585246,924,504233,596,0004,169,00016,801,792stderr
2Sep 4, 2026 08:311,586246,431,718233,784,0004,192,00016,801,792stderr
3Sep 4, 2026 08:311,586246,866,880233,860,0004,189,00016,801,792stderr
4Sep 4, 2026 08:311,587246,808,854234,043,0004,117,00016,801,792stderr
5Sep 4, 2026 08:311,587246,561,502233,895,0004,185,00016,801,792stderr
6Sep 4, 2026 08:311,588246,652,208234,027,0004,173,00016,801,792stderr
7Sep 4, 2026 08:311,590247,100,645234,399,0004,185,00016,801,792stderr
8Sep 4, 2026 08:311,591247,239,496234,485,0004,233,00016,801,792stderr
9Sep 4, 2026 08:311,591247,221,857234,552,0004,170,00016,801,792stderr