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 listAug 12, 2025 01:27SergeBouSergeBouScore: 61,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 01:2761,2379,231,246,8789,127,600,00057,927,00017,145,856
2Aug 12, 2025 01:2761,3299,239,968,8579,156,374,00042,945,00017,031,168
3Aug 12, 2025 01:2761,3539,247,812,8119,138,056,00064,915,00017,207,296
4Aug 12, 2025 01:2761,3769,247,879,9719,163,482,00042,946,00017,195,008
5Aug 12, 2025 01:2761,3869,249,096,3159,166,890,00040,950,00017,215,488
6Aug 12, 2025 01:2761,3869,245,945,5569,163,910,00043,946,00017,010,688
7Aug 12, 2025 01:2761,3959,246,994,3199,154,261,00054,929,00017,182,720
8Aug 12, 2025 01:2761,4159,252,364,9619,164,357,00047,939,00016,977,920
9Aug 12, 2025 01:2761,5049,271,802,4009,178,608,00046,941,00017,096,704