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 20, 2025 00:46izotoffizotoffScore: 4,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2025 00:464,693730,923,600675,955,00027,956,00017,084,416
2Nov 20, 2025 00:464,696728,669,979678,365,00025,975,00016,969,728
3Nov 20, 2025 00:464,704730,074,338681,598,00023,985,00016,953,344
4Nov 20, 2025 00:464,705731,099,127683,726,00021,991,00016,965,632
5Nov 20, 2025 00:464,710735,975,769678,556,00027,981,00017,182,720
6Nov 20, 2025 00:464,715728,696,688683,212,00023,972,00017,022,976
7Nov 20, 2025 00:464,723733,290,200683,402,00024,978,00017,182,720
8Nov 20, 2025 00:464,772742,691,042688,831,00026,993,00016,953,344
9Nov 20, 2025 00:464,907763,865,725711,088,00024,968,00016,986,112