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 listSep 21, 2026 16:14Andrew EpsteinAndrew EpsteinScore: 10,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 16:1510,1171,528,075,9981,486,960,00030,686,00016,801,792stderr
2Sep 21, 2026 16:1510,1201,528,464,1571,487,281,00030,732,00016,801,792stderr
3Sep 21, 2026 16:1510,1201,528,424,6701,487,420,00030,642,00016,801,792stderr
4Sep 21, 2026 16:1510,1201,528,562,7841,487,411,00030,738,00016,797,696stderr
5Sep 21, 2026 16:1510,1221,529,120,9301,487,502,00030,907,00016,797,696stderr
6Sep 21, 2026 16:1510,1231,528,945,7291,487,661,00030,901,00016,801,792stderr
7Sep 21, 2026 16:1510,1371,539,457,1921,489,654,00031,040,00016,801,792stderr
8Sep 21, 2026 16:1510,1391,531,485,9931,490,132,00030,736,00016,801,792stderr
9Sep 21, 2026 16:1510,1391,531,142,7981,489,841,00031,009,00016,797,696stderr