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 listJun 24, 2026 09:10anboto1anboto1Score: 43,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 09:1243,2816,502,410,5376,434,558,00057,695,00017,305,600
2Jun 24, 2026 09:1243,3386,510,197,7106,448,213,00052,540,00017,473,536
3Jun 24, 2026 09:1243,3446,511,388,2846,446,741,00054,967,00017,457,152
4Jun 24, 2026 09:1243,3526,512,899,6336,449,727,00053,176,00017,465,344
5Jun 24, 2026 09:1243,3636,514,130,9926,452,340,00052,126,00017,379,328
6Jun 24, 2026 09:1243,4396,525,725,5016,458,150,00057,749,00017,498,112
7Jun 24, 2026 09:1243,5176,537,160,2036,473,574,00054,053,00017,453,056
8Jun 24, 2026 09:1243,5276,538,966,7386,476,050,00053,128,00017,436,672
9Jun 24, 2026 09:1243,5686,545,106,2946,476,976,00058,280,00017,502,208