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 15:33Andrew EpsteinAndrew EpsteinScore: 10,638Success
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 15:3310,6241,604,079,7101,563,412,00030,270,00016,797,696stderr
2Sep 21, 2026 15:3310,6261,605,127,2611,563,397,00030,552,00016,801,792stderr
3Sep 21, 2026 15:3310,6261,604,944,4701,563,490,00030,442,00016,801,792stderr
4Sep 21, 2026 15:3310,6271,605,165,7101,563,853,00030,272,00016,801,792stderr
5Sep 21, 2026 15:3310,6381,606,044,7741,565,375,00030,378,00016,801,792stderr
6Sep 21, 2026 15:3310,6391,606,632,3521,565,030,00030,936,00016,801,792stderr
7Sep 21, 2026 15:3310,6401,606,969,4071,565,588,00030,455,00016,801,792stderr
8Sep 21, 2026 15:3310,6401,607,021,7271,565,676,00030,411,00016,801,792stderr
9Sep 21, 2026 15:3310,6411,607,720,0361,565,849,00030,422,00016,801,792stderr