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 09:14TudyMTudyMScore: 5,469Success
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 09:155,447837,191,843789,110,00028,003,00017,133,568
2Apr 28, 2026 09:155,454840,356,531790,188,00028,006,00017,154,048
3Apr 28, 2026 09:155,461839,709,653787,295,00031,971,00017,215,488
4Apr 28, 2026 09:155,464840,290,653791,712,00027,989,00017,145,856
5Apr 28, 2026 09:155,469844,572,790790,375,00029,976,00017,072,128
6Apr 28, 2026 09:155,470840,221,234779,613,00040,979,00017,149,952
7Apr 28, 2026 09:155,482840,921,462785,458,00036,974,00017,141,760
8Apr 28, 2026 09:155,482841,360,177789,460,00032,977,00017,149,952
9Apr 28, 2026 09:155,514843,708,212796,164,00030,967,00017,178,624