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:20Andrew EpsteinAndrew EpsteinScore: 9,695Success
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:219,6931,465,118,9241,423,008,00031,065,00016,797,696stderr
2Sep 21, 2026 17:219,6941,465,220,1761,423,209,00030,981,00016,801,792stderr
3Sep 21, 2026 17:219,6941,465,136,4201,423,200,00030,999,00016,801,792stderr
4Sep 21, 2026 17:219,6941,464,541,0601,423,180,00030,987,00016,801,792stderr
5Sep 21, 2026 17:219,6951,464,527,9401,423,367,00030,888,00016,801,792stderr
6Sep 21, 2026 17:219,6971,464,967,3111,423,576,00031,062,00016,801,792stderr
7Sep 21, 2026 17:219,7141,467,465,0451,426,012,00031,148,00016,801,792stderr
8Sep 21, 2026 17:219,7151,467,506,2011,426,096,00031,171,00016,801,792stderr
9Sep 21, 2026 17:219,7161,468,400,8601,426,079,00031,361,00016,801,792stderr