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:33Huy Duc LeHuy Duc LeScore: 2,981Success
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:332,970467,770,528414,553,00030,966,00016,990,208
2Nov 1, 2025 02:332,978472,936,234414,729,00031,979,00017,022,976
3Nov 1, 2025 02:332,978472,865,953411,744,00034,978,00016,994,304
4Nov 1, 2025 02:332,980471,615,483426,036,00021,001,00016,986,112
5Nov 1, 2025 02:332,981475,801,568417,078,00030,005,00016,982,016
6Nov 1, 2025 02:332,981468,603,473420,114,00027,007,00017,190,912
7Nov 1, 2025 02:332,981473,926,809421,159,00026,009,00017,170,432
8Nov 1, 2025 02:332,984474,332,945416,602,00030,970,00017,092,608
9Nov 1, 2025 02:332,987471,726,058413,049,00035,004,00016,994,304