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 17, 2026 19:14Charles CabergsCharles CabergsScore: 7,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 19:147,7481,189,479,9621,132,244,00029,979,00017,207,296
2Apr 17, 2026 19:147,7691,191,644,3301,125,360,00039,977,00017,211,392
3Apr 17, 2026 19:147,8011,197,308,0071,133,145,00036,972,00017,186,816
4Apr 17, 2026 19:147,8801,217,101,8131,145,014,00036,968,00016,982,016
5Apr 17, 2026 19:147,8821,214,754,1521,137,308,00044,972,00016,953,344
6Apr 17, 2026 19:147,8841,211,088,5911,141,673,00040,988,00017,137,664
7Apr 17, 2026 19:147,9131,213,713,6501,142,930,00043,958,00016,953,344
8Apr 17, 2026 19:147,9781,226,379,9181,160,756,00035,961,00017,207,296
9Apr 17, 2026 19:148,0311,231,026,8741,171,615,00032,961,00016,998,400