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 listJun 24, 2026 14:15anboto1anboto1Score: 3,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 14:153,096473,651,699439,134,00025,277,00016,793,600
2Jun 24, 2026 14:153,097473,854,291439,370,00025,200,00016,793,600
3Jun 24, 2026 14:153,103474,824,853439,300,00026,152,00016,793,600
4Jun 24, 2026 14:153,104474,795,926439,684,00025,917,00016,793,600
5Jun 24, 2026 14:153,104474,924,935441,092,00024,655,00016,793,600
6Jun 24, 2026 14:153,109475,616,190440,322,00026,142,00016,793,600
7Jun 24, 2026 14:153,116476,588,338441,871,00025,584,00016,793,600
8Jun 24, 2026 14:153,116476,667,232441,351,00026,056,00016,793,600
9Jun 24, 2026 14:153,119476,927,622442,553,00025,304,00016,793,600