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 20:51Victor MerckléVictor MerckléScore: 1,585Success
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 20:541,583248,239,749233,220,0004,249,00016,797,696stderr
2Aug 30, 2026 20:541,583247,508,330233,303,0004,242,00016,797,696stderr
3Aug 30, 2026 20:541,583247,379,952233,243,0004,246,00016,797,696stderr
4Aug 30, 2026 20:541,584247,522,911233,397,0004,265,00016,797,696stderr
5Aug 30, 2026 20:541,585247,848,874233,612,0004,255,00016,797,696stderr
6Aug 30, 2026 20:541,587248,087,813233,781,0004,302,00016,797,696stderr
7Aug 30, 2026 20:541,588248,147,071233,985,0004,238,00016,797,696stderr
8Aug 30, 2026 20:541,589248,413,252234,105,0004,325,00016,797,696stderr
9Aug 30, 2026 20:541,590248,485,050234,247,0004,306,00016,797,696stderr