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 14, 2025 16:15izotoffizotoffScore: 32,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 16:1532,2394,868,808,7624,732,900,000102,910,00013,778,944
2Nov 14, 2025 16:1532,2424,870,427,5944,730,365,000105,918,00014,008,320
3Nov 14, 2025 16:1532,2424,864,022,0154,733,372,000102,921,00016,973,824
4Nov 14, 2025 16:1532,2434,866,213,3274,740,509,00095,929,00017,039,360
5Nov 14, 2025 16:1532,2604,873,712,4364,734,153,000104,914,00010,756,096
6Nov 14, 2025 16:1532,2784,881,820,9604,726,840,000114,898,00013,565,952
7Nov 14, 2025 16:1532,3004,890,063,3864,738,164,000106,890,00012,185,600
8Nov 14, 2025 16:1532,3114,885,704,4884,721,795,000124,862,0009,154,560
9Nov 14, 2025 16:1532,3734,925,847,6394,740,053,000115,903,00016,277,504