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:47Huy Duc LeHuy Duc LeScore: 2,985Success
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:472,973472,336,543419,020,00027,001,00017,195,008
2Nov 1, 2025 02:472,975476,681,753422,180,00024,010,00016,990,208
3Nov 1, 2025 02:472,976470,011,882419,413,00027,026,00017,170,432
4Nov 1, 2025 02:472,977467,605,195414,522,00031,963,00016,982,016
5Nov 1, 2025 02:472,985475,213,454425,828,00021,991,00017,162,240
6Nov 1, 2025 02:472,986476,420,914412,915,00034,992,00016,977,920
7Nov 1, 2025 02:472,990474,466,856419,561,00028,969,00017,137,664
8Nov 1, 2025 02:472,991474,298,093414,608,00033,967,00016,949,248
9Nov 1, 2025 02:472,998475,251,970416,691,00032,975,00017,154,048