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:24Andrew EpsteinAndrew EpsteinScore: 29,334Success
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:2629,3164,409,156,1534,321,822,00075,680,00016,801,792stderr
2Sep 21, 2026 14:2629,3174,408,520,1344,320,634,00077,019,00016,801,792stderr
3Sep 21, 2026 14:2629,3254,409,514,7864,320,649,00078,109,00016,801,792stderr
4Sep 21, 2026 14:2629,3284,409,702,7264,323,120,00076,162,00016,797,696stderr
5Sep 21, 2026 14:2629,3344,410,711,6404,324,882,00075,357,00016,801,792stderr
6Sep 21, 2026 14:2629,3494,413,630,3804,325,024,00077,364,00016,797,696stderr
7Sep 21, 2026 14:2629,3724,416,296,0674,329,369,00076,514,00016,801,792stderr
8Sep 21, 2026 14:2629,3964,419,811,0054,333,500,00075,941,00016,801,792stderr
9Sep 21, 2026 14:2629,4934,434,705,2264,348,167,00075,895,00016,801,792stderr