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 listFeb 16, 2026 18:19Valentin KofmanValentin KofmanScore: 3,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:193,891606,975,700573,690,0009,994,00017,092,608
2Feb 16, 2026 18:193,894624,127,886573,150,00011,002,00017,178,624
3Feb 16, 2026 18:193,899610,458,622573,793,00010,996,00017,051,648
4Feb 16, 2026 18:193,899611,272,995573,918,00010,998,00016,973,824
5Feb 16, 2026 18:193,900610,775,711576,928,0007,999,00016,965,632
6Feb 16, 2026 18:193,900607,640,440575,017,00010,000,00017,162,240
7Feb 16, 2026 18:193,902610,487,530575,264,0009,987,00016,977,920
8Feb 16, 2026 18:193,902619,264,400574,379,00010,988,00017,055,744
9Feb 16, 2026 18:193,904606,052,373574,562,00010,991,00017,014,784