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 listJan 29, 2025 11:13NoSIMD_C#NoSIMD_C#Score: 112,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 11:13112,05616,851,489,07716,773,369,00034,961,00016,965,632
2Jan 29, 2025 11:13112,17416,868,594,45016,782,178,00043,945,00016,965,632
3Jan 29, 2025 11:13112,26016,886,169,79516,791,114,00047,946,00016,998,400
4Jan 29, 2025 11:13112,33516,896,452,19616,811,340,00038,954,00017,182,720
5Jan 29, 2025 11:13112,35016,893,765,62616,806,551,00045,949,00016,994,304
6Jan 29, 2025 11:13112,37916,900,892,21816,807,918,00048,935,00016,965,632
7Jan 29, 2025 11:13112,74016,955,018,49816,861,056,00049,943,00017,059,840
8Jan 29, 2025 11:13123,77018,614,293,10018,522,512,00042,954,00016,969,728
9Jan 29, 2025 11:13125,43118,859,678,98718,776,680,00037,960,00017,199,104