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 25, 2026 17:29olliecrowolliecrowScore: 3,234Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 17:303,232501,005,310478,887,0005,998,00017,027,072
2Apr 25, 2026 17:303,233504,590,697479,970,0004,999,00017,010,688
3Apr 25, 2026 17:303,233502,004,311479,074,0006,000,00017,006,592
4Apr 25, 2026 17:303,233504,873,196480,076,0005,000,00016,998,400
5Apr 25, 2026 17:303,234501,730,305479,131,0006,001,00017,010,688
6Apr 25, 2026 17:303,234505,412,219478,158,0007,002,00017,108,992
7Apr 25, 2026 17:303,235499,056,350479,279,0006,003,00017,006,592
8Apr 25, 2026 17:303,235501,692,507478,344,0006,990,00017,010,688
9Apr 25, 2026 17:303,241505,756,141480,230,0006,002,00016,998,400