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:37SergeBouSergeBouScore: 12,415Success
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:3711,1811,715,150,2181,634,288,00042,902,00017,391,616
2Aug 12, 2025 01:3711,2871,728,194,0791,653,187,00039,907,00017,063,936
3Aug 12, 2025 01:3712,1881,864,906,1761,783,370,00044,883,00017,182,720
4Aug 12, 2025 01:3712,2401,872,079,1361,791,029,00044,900,00017,018,880
5Aug 12, 2025 01:3712,4151,896,662,7551,820,418,00041,871,00017,182,720
6Aug 12, 2025 01:3712,5181,907,566,0371,830,880,00046,894,00017,203,200
7Aug 12, 2025 01:3712,6341,929,342,3041,854,180,00040,915,00017,027,072
8Aug 12, 2025 01:3712,7761,949,562,5451,867,546,00048,883,00017,022,976
9Aug 12, 2025 01:3713,6172,076,239,9852,000,590,00041,886,00016,973,824