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 26, 2026 14:36Kevin HeaveyKevin HeaveyScore: 1,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 14:371,576245,337,396230,387,0006,035,00016,793,600
2Sep 26, 2026 14:371,576245,378,733230,449,0006,079,00016,793,600
3Sep 26, 2026 14:371,577245,530,782230,443,0006,243,00016,793,600
4Sep 26, 2026 14:371,577245,533,741230,464,0006,108,00016,793,600
5Sep 26, 2026 14:371,578245,581,326230,605,0006,101,00016,793,600
6Sep 26, 2026 14:371,578245,624,988230,718,0006,038,00016,793,600
7Sep 26, 2026 14:371,579245,825,026230,861,0006,093,00016,793,600
8Sep 26, 2026 14:371,581246,113,228231,053,0006,105,00016,793,600
9Sep 26, 2026 14:371,587247,013,181231,893,0006,168,00016,793,600