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 listOct 21, 2026 00:28e1011e1011Score: 88,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 00:3188,33113,260,702,47413,245,228,0004,541,00016,793,600
2Oct 21, 2026 00:3188,37613,267,999,26413,249,782,0006,662,00016,793,600
3Oct 21, 2026 00:3188,40013,271,157,33813,255,718,0004,421,00016,793,600
4Oct 21, 2026 00:3188,84713,338,189,83113,322,452,0004,635,00016,793,600
5Oct 21, 2026 00:3188,89113,345,497,67713,328,664,0005,110,00016,793,600
6Oct 21, 2026 00:3189,00613,361,978,67613,346,626,0004,357,00016,793,600
7Oct 21, 2026 00:3189,33513,411,275,31913,395,288,0005,094,00016,793,600
8Oct 21, 2026 00:3189,53613,441,832,05213,425,097,0005,321,00016,793,600
9Oct 21, 2026 00:3190,08413,523,755,88413,507,175,0005,563,00016,793,600