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 12:48anboto1anboto1Score: 3,164Success
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 12:483,144481,149,846446,423,00025,200,00016,793,600
2Jun 24, 2026 12:483,158483,074,922448,005,00025,836,00016,793,600
3Jun 24, 2026 12:483,159483,136,578448,101,00025,871,00016,793,600
4Jun 24, 2026 12:483,163483,688,906448,496,00026,052,00016,793,600
5Jun 24, 2026 12:483,164483,741,954449,207,00025,394,00016,793,600
6Jun 24, 2026 12:483,189487,610,539452,581,00025,824,00016,793,600
7Jun 24, 2026 12:483,190487,721,373452,717,00025,877,00016,793,600
8Jun 24, 2026 12:483,205489,851,696455,586,00025,187,00016,793,600
9Jun 24, 2026 12:483,242504,141,139460,554,00025,852,00016,793,600