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 listSep 21, 2026 14:58Andrew EpsteinAndrew EpsteinScore: 13,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 14:5913,4922,035,066,9601,977,061,00046,812,00016,801,792stderr
2Sep 21, 2026 14:5913,4932,035,118,5641,977,705,00046,289,00016,801,792stderr
3Sep 21, 2026 14:5913,4932,034,365,8381,977,681,00046,270,00016,801,792stderr
4Sep 21, 2026 14:5913,4962,035,456,5591,977,875,00046,602,00016,801,792stderr
5Sep 21, 2026 14:5913,4982,035,799,9921,978,038,00046,737,00016,801,792stderr
6Sep 21, 2026 14:5913,5022,036,461,1471,978,944,00046,497,00016,797,696stderr
7Sep 21, 2026 14:5913,5152,038,354,4261,980,874,00046,504,00016,801,792stderr
8Sep 21, 2026 14:5913,5162,038,662,0071,980,903,00046,617,00016,801,792stderr
9Sep 21, 2026 14:5913,5212,039,150,6171,981,276,00046,951,00016,801,792stderr