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 listMay 14, 2026 00:03Aleksei ShahoikaAleksei ShahoikaScore: 2,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 00:032,136330,127,580314,542,0005,954,00016,797,696
2May 14, 2026 00:032,147331,211,305316,403,0005,672,00016,797,696
3May 14, 2026 00:032,149332,858,276316,749,0005,662,00016,797,696
4May 14, 2026 00:032,149333,372,805316,551,0005,889,00016,797,696
5May 14, 2026 00:032,157332,289,395317,946,0005,677,00016,797,696
6May 14, 2026 00:032,159334,160,369318,228,0005,666,00016,797,696
7May 14, 2026 00:032,161332,903,433318,563,0005,647,00016,797,696
8May 14, 2026 00:032,169336,116,204319,255,0006,095,00016,797,696
9May 14, 2026 00:032,177337,542,927320,631,0006,004,00016,797,696