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 listMar 21, 2026 04:17Dominique GarmierDominique GarmierScore: 4,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 04:174,615719,153,067664,318,00027,971,00016,990,208
2Mar 21, 2026 04:174,616723,861,291667,392,00024,977,00017,125,376
3Mar 21, 2026 04:174,618725,596,906662,693,00029,940,00017,190,912
4Mar 21, 2026 04:174,618718,547,834665,735,00026,948,00017,117,184
5Mar 21, 2026 04:174,623724,607,096667,519,00025,981,00017,014,784
6Mar 21, 2026 04:174,629727,319,300666,383,00027,974,00017,129,472
7Mar 21, 2026 04:174,720736,698,591676,990,00030,953,00016,957,440
8Mar 21, 2026 04:174,723738,075,228677,544,00030,979,00016,973,824
9Mar 21, 2026 04:174,731736,137,438679,769,00029,945,00016,990,208