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 30, 2026 23:13Victor MerckléVictor MerckléScore: 1,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 23:201,620251,611,484238,950,0004,176,00016,801,792stderr
2Aug 30, 2026 23:201,621252,355,478238,959,0004,202,00016,801,792stderr
3Aug 30, 2026 23:201,621251,871,872238,903,0004,379,00016,801,792stderr
4Aug 30, 2026 23:201,621251,868,479238,860,0004,373,00016,801,792stderr
5Aug 30, 2026 23:201,621251,699,201239,026,0004,184,00016,801,792stderr
6Aug 30, 2026 23:201,622251,837,890238,980,0004,323,00016,801,792stderr
7Aug 30, 2026 23:201,623251,901,736239,315,0004,172,00016,801,792stderr
8Aug 30, 2026 23:201,624252,892,332239,502,0004,226,00016,801,792stderr
9Aug 30, 2026 23:201,625252,356,793239,568,0004,225,00016,801,792stderr