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 3, 2026 12:26Victor MerckléVictor MerckléScore: 1,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 12:271,635255,377,554237,505,0007,872,00016,801,792stderr
2Aug 3, 2026 12:271,635255,172,259237,413,0007,879,00016,801,792stderr
3Aug 3, 2026 12:271,636256,121,804237,592,0007,928,00016,801,792stderr
4Aug 3, 2026 12:271,637255,617,651237,695,0007,978,00016,801,792stderr
5Aug 3, 2026 12:271,638255,850,100237,850,0007,994,00016,801,792stderr
6Aug 3, 2026 12:271,638255,667,274237,880,0007,928,00016,801,792stderr
7Aug 3, 2026 12:271,639255,880,674237,940,0007,937,00016,801,792stderr
8Aug 3, 2026 12:271,641256,029,277238,180,0007,985,00016,801,792stderr
9Aug 3, 2026 12:271,641256,155,239238,165,0008,025,00016,801,792stderr