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 listApr 22, 2026 00:42olliecrowolliecrowScore: 4,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 00:444,660719,215,218675,063,00023,966,00017,190,912
2Apr 22, 2026 00:444,678711,001,707675,784,00025,953,00017,035,264
3Apr 22, 2026 00:444,678710,967,975671,798,00029,946,00017,092,608
4Apr 22, 2026 00:444,683710,868,941673,535,00029,023,00017,125,376
5Apr 22, 2026 00:444,689712,940,720673,483,00029,977,00017,059,840
6Apr 22, 2026 00:444,694712,509,806674,253,00029,966,00017,027,072
7Apr 22, 2026 00:444,700722,458,309678,059,00026,962,00017,014,784
8Apr 22, 2026 00:444,712715,258,458677,975,00028,956,00017,137,664
9Apr 22, 2026 00:444,721716,501,815678,235,00029,966,00017,248,256