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 17:18Andrew EpsteinAndrew EpsteinScore: 9,685Success
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 17:199,6801,462,565,7741,421,159,00030,961,00016,801,792stderr
2Sep 21, 2026 17:199,6811,462,654,7771,421,445,00030,813,00016,801,792stderr
3Sep 21, 2026 17:199,6811,463,672,9961,421,297,00030,946,00016,797,696stderr
4Sep 21, 2026 17:199,6851,463,150,4761,421,704,00031,099,00016,801,792stderr
5Sep 21, 2026 17:199,6851,463,150,6201,421,726,00031,042,00016,797,696stderr
6Sep 21, 2026 17:199,6871,463,519,4941,422,006,00031,170,00016,801,792stderr
7Sep 21, 2026 17:199,7051,466,858,0941,424,568,00031,305,00016,801,792stderr
8Sep 21, 2026 17:199,7051,466,851,9941,424,682,00031,214,00016,801,792stderr
9Sep 21, 2026 17:199,7121,467,225,5621,425,686,00031,224,00016,801,792stderr