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 17:06Andrew EpsteinAndrew EpsteinScore: 6,643Success
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 17:076,6391,006,675,216973,755,00022,167,00016,801,792stderr
2Sep 21, 2026 17:076,6401,007,038,443974,016,00022,057,00016,801,792stderr
3Sep 21, 2026 17:076,6411,006,456,908974,139,00022,050,00016,801,792stderr
4Sep 21, 2026 17:076,6411,006,640,192973,955,00022,265,00016,801,792stderr
5Sep 21, 2026 17:076,6431,007,179,962974,064,00022,398,00016,801,792stderr
6Sep 21, 2026 17:076,6451,007,630,175974,696,00022,102,00016,801,792stderr
7Sep 21, 2026 17:076,6541,009,143,945976,038,00022,200,00016,801,792stderr
8Sep 21, 2026 17:076,6541,009,055,673975,994,00022,195,00016,801,792stderr
9Sep 21, 2026 17:076,6551,009,210,518976,048,00022,313,00016,801,792stderr