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 14:51Andrew EpsteinAndrew EpsteinScore: 10,156Success
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 14:5210,1551,533,713,6801,492,632,00030,735,00016,801,792stderr
2Sep 21, 2026 14:5210,1551,534,337,3671,492,553,00030,817,00016,801,792stderr
3Sep 21, 2026 14:5210,1561,533,762,7761,492,693,00030,762,00016,801,792stderr
4Sep 21, 2026 14:5210,1561,533,694,6051,492,905,00030,509,00016,797,696stderr
5Sep 21, 2026 14:5210,1561,534,269,4801,492,563,00030,907,00016,801,792stderr
6Sep 21, 2026 14:5210,1581,534,174,9161,492,864,00030,901,00016,801,792stderr
7Sep 21, 2026 14:5210,1711,536,064,7021,494,809,00030,954,00016,801,792stderr
8Sep 21, 2026 14:5210,1801,537,374,7321,495,893,00031,110,00016,801,792stderr
9Sep 21, 2026 14:5210,1811,537,475,0911,496,176,00031,047,00016,801,792stderr