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:37Huy Duc LeHuy Duc LeScore: 2,980Success
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:372,973471,835,205421,954,00023,997,00017,096,704
2Nov 1, 2025 02:372,974473,108,360414,038,00032,002,00016,998,400
3Nov 1, 2025 02:372,975477,630,637421,247,00025,014,00016,982,016
4Nov 1, 2025 02:372,977475,019,476409,640,00036,967,00017,195,008
5Nov 1, 2025 02:372,980474,400,725424,978,00021,998,00017,170,432
6Nov 1, 2025 02:372,981474,172,662418,107,00029,007,00016,990,208
7Nov 1, 2025 02:372,983477,591,728417,449,00029,960,00017,137,664
8Nov 1, 2025 02:372,984473,328,087421,574,00025,973,00016,957,440
9Nov 1, 2025 02:372,985468,714,564417,752,00029,982,00017,162,240