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 listApr 28, 2026 08:47TudyMTudyMScore: 5,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:475,566854,616,252800,921,00033,996,00017,133,568
2Apr 28, 2026 08:475,580858,135,459797,096,00040,004,00017,010,688
3Apr 28, 2026 08:475,592854,295,294805,825,00032,992,00017,145,856
4Apr 28, 2026 08:475,627865,597,117807,074,00037,003,00017,149,952
5Apr 28, 2026 08:475,661870,672,856814,233,00034,967,00017,162,240
6Apr 28, 2026 08:475,823894,587,449845,551,00027,985,00017,141,760
7Apr 28, 2026 08:475,831896,266,888837,806,00036,991,00017,149,952
8Apr 28, 2026 08:475,859900,858,926843,966,00034,998,00017,149,952
9Apr 28, 2026 08:475,968910,949,010863,285,00031,973,00017,211,392