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:44TudyMTudyMScore: 6,044Success
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:445,939913,822,928854,901,00035,995,00017,145,856
2Apr 28, 2026 08:446,006922,373,723865,983,00034,958,00017,137,664
3Apr 28, 2026 08:446,023923,550,222869,509,00033,980,00017,027,072
4Apr 28, 2026 08:446,027924,902,069870,198,00033,968,00017,145,856
5Apr 28, 2026 08:446,044922,230,073873,632,00032,986,00017,145,856
6Apr 28, 2026 08:446,052926,001,938870,903,00036,995,00017,149,952
7Apr 28, 2026 08:446,092933,853,629882,935,00030,962,00017,145,856
8Apr 28, 2026 08:446,222951,173,243897,362,00035,974,00017,145,856
9Apr 28, 2026 08:446,223951,159,345903,599,00029,986,00017,113,088