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 09:02anboto1anboto1Score: 43,376Success
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 09:0343,2526,497,958,8436,435,122,00052,723,00017,428,480
2Jun 24, 2026 09:0343,3176,507,986,2776,439,235,00058,369,00017,403,904
3Jun 24, 2026 09:0343,3476,512,001,4476,449,113,00053,066,00017,457,152
4Jun 24, 2026 09:0343,3686,515,180,9646,447,632,00057,685,00017,399,808
5Jun 24, 2026 09:0343,3766,516,822,0946,453,625,00052,896,00017,043,456
6Jun 24, 2026 09:0343,4156,522,513,6066,458,165,00054,122,00017,428,480
7Jun 24, 2026 09:0343,5336,539,906,9356,472,039,00058,031,00017,543,168
8Jun 24, 2026 09:0343,5816,546,982,2716,478,195,00059,019,00017,526,784
9Jun 24, 2026 09:0343,6146,551,657,0566,484,619,00057,614,00017,403,904