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 listNov 1, 2025 02:31Huy Duc LeHuy Duc LeScore: 2,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2025 02:312,972467,470,539414,837,00030,987,00017,158,144
2Nov 1, 2025 02:312,973470,476,507417,888,00027,992,00016,990,208
3Nov 1, 2025 02:312,973473,240,099412,983,00032,998,00017,170,432
4Nov 1, 2025 02:312,980472,058,263414,989,00031,999,00016,990,208
5Nov 1, 2025 02:312,983470,720,166417,512,00029,965,00016,998,400
6Nov 1, 2025 02:312,985473,695,001416,833,00030,987,00017,018,880
7Nov 1, 2025 02:312,989472,165,910417,450,00030,959,00017,117,184
8Nov 1, 2025 02:312,990477,509,263421,467,00026,965,00016,982,016
9Nov 1, 2025 02:313,002481,014,006425,235,00025,013,00016,977,920