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 listApr 18, 2026 05:26limanjun99limanjun99Score: 3,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 05:263,120490,682,503432,061,00036,005,00016,990,208
2Apr 18, 2026 05:263,136500,354,180427,403,00042,940,00017,199,104
3Apr 18, 2026 05:263,138493,900,121431,751,00038,977,00016,990,208
4Apr 18, 2026 05:263,138492,336,974430,791,00039,980,00017,203,200
5Apr 18, 2026 05:263,141497,384,399426,296,00044,925,00016,973,824
6Apr 18, 2026 05:263,148503,890,977436,164,00036,013,00017,166,336
7Apr 18, 2026 05:263,150496,010,822438,604,00033,969,00017,072,128
8Apr 18, 2026 05:263,151498,337,413437,672,00034,973,00017,051,648
9Apr 18, 2026 05:263,152499,692,599435,747,00036,978,00017,031,168