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 listFeb 16, 2026 16:37Valentin KofmanValentin KofmanScore: 59,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 16:3759,0408,897,874,2688,840,060,00015,967,00016,998,400
2Feb 16, 2026 16:3759,0648,908,882,8778,833,631,00025,946,00017,199,104
3Feb 16, 2026 16:3759,0908,905,770,0808,843,536,00019,960,00017,129,472
4Feb 16, 2026 16:3759,1128,910,343,8898,837,930,00028,940,00017,203,200
5Feb 16, 2026 16:3759,2118,920,100,1538,854,660,00026,947,00017,174,528
6Feb 16, 2026 16:3759,2298,929,575,8248,849,397,00034,934,00017,055,744
7Feb 16, 2026 16:3759,2328,925,693,2848,858,812,00025,946,00017,203,200
8Feb 16, 2026 16:3759,2458,929,366,1758,865,829,00020,954,00017,199,104
9Feb 16, 2026 16:3759,2988,938,525,1128,864,820,00029,938,00017,178,624