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 listAug 27, 2026 12:18Victor MerckléVictor MerckléScore: 1,624Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 12:191,623253,409,943235,555,0007,903,00016,801,792stderr
2Aug 27, 2026 12:191,623253,385,172235,581,0007,899,00016,801,792stderr
3Aug 27, 2026 12:191,623254,122,497235,661,0007,938,00016,801,792stderr
4Aug 27, 2026 12:191,624253,680,282235,714,0007,975,00016,801,792stderr
5Aug 27, 2026 12:191,624253,663,552235,697,0007,952,00016,801,792stderr
6Aug 27, 2026 12:191,625253,596,081235,856,0007,899,00016,801,792stderr
7Aug 27, 2026 12:191,625253,639,677235,816,0007,946,00016,801,792stderr
8Aug 27, 2026 12:191,626253,996,126236,020,0008,026,00016,801,792stderr
9Aug 27, 2026 12:191,627254,646,197236,083,0008,012,00016,801,792stderr