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 listMar 21, 2026 13:39limanjun99limanjun99Score: 5,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 13:395,691877,025,220830,694,00022,963,00016,969,728
2Mar 21, 2026 13:395,710889,583,834826,567,00029,948,00016,973,824
3Mar 21, 2026 13:395,710879,540,455831,602,00024,958,00016,945,152
4Mar 21, 2026 13:395,722891,665,730828,317,00029,939,00017,170,432
5Mar 21, 2026 13:395,722882,518,358837,346,00020,958,00017,203,200
6Mar 21, 2026 13:395,726888,193,910831,033,00027,933,00016,949,248
7Mar 21, 2026 13:395,731890,179,730826,687,00032,947,00017,199,104
8Mar 21, 2026 13:396,237963,745,413907,602,00027,956,00017,010,688
9Mar 21, 2026 13:396,288971,672,637917,297,00025,951,00017,207,296