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 22, 2026 10:53olliecrowolliecrowScore: 4,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 10:564,281661,285,981610,319,00031,964,00017,235,968
2Apr 22, 2026 10:564,286663,394,963619,048,00024,001,00017,117,184
3Apr 22, 2026 10:564,295652,601,948620,417,00023,977,00017,137,664
4Apr 22, 2026 10:564,300653,468,710614,174,00030,958,00017,002,496
5Apr 22, 2026 10:564,311655,941,231617,827,00028,945,00017,039,360
6Apr 22, 2026 10:564,315655,663,051618,423,00028,972,00017,227,776
7Apr 22, 2026 10:564,316666,875,481614,552,00032,975,00017,240,064
8Apr 22, 2026 10:564,319658,726,891611,974,00035,939,00017,133,568
9Apr 22, 2026 10:564,328658,691,372622,240,00026,967,00017,215,488