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:19Dominique GarmierDominique GarmierScore: 4,394Success
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:194,378692,225,487629,740,00026,988,00017,133,568
2Mar 21, 2026 04:194,385699,445,948628,745,00028,988,00017,027,072
3Mar 21, 2026 04:194,387687,461,653630,075,00027,958,00016,982,016
4Mar 21, 2026 04:194,391689,963,838629,730,00028,987,00017,043,456
5Mar 21, 2026 04:194,394690,755,230630,133,00028,960,00017,121,280
6Mar 21, 2026 04:194,405693,596,111629,778,00030,989,00017,080,320
7Mar 21, 2026 04:194,457696,963,954639,562,00028,934,00017,186,816
8Mar 21, 2026 04:194,458688,739,317638,653,00029,983,00017,129,472
9Mar 21, 2026 04:194,545707,293,814655,793,00025,952,00017,043,456