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 19, 2026 00:13Dominique GarmierDominique GarmierScore: 4,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 05:234,793750,433,961682,003,00036,946,00017,072,128
2Mar 19, 2026 00:134,801749,924,002693,119,00026,965,00016,965,632
3Mar 19, 2026 05:234,801748,469,790693,139,00026,966,00017,027,072
4Mar 19, 2026 00:134,811749,149,718690,671,00030,940,00017,162,240
5Mar 19, 2026 05:234,814750,074,161694,141,00027,965,00017,051,648
6Mar 19, 2026 00:134,827749,603,721697,069,00026,963,00017,051,648