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 28, 2026 09:13TudyMTudyMScore: 5,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:135,782885,987,551836,360,00030,976,00017,035,264
2Apr 28, 2026 09:135,788887,942,208838,345,00029,976,00017,145,856
3Apr 28, 2026 09:135,789885,497,581836,476,00031,979,00017,154,048
4Apr 28, 2026 09:135,789888,360,317839,436,00028,980,00017,149,952
5Apr 28, 2026 09:135,793888,794,839838,062,00031,002,00017,141,760
6Apr 28, 2026 09:135,794888,249,417837,107,00032,004,00017,022,976
7Apr 28, 2026 09:135,797887,053,061843,617,00025,988,00016,973,824
8Apr 28, 2026 09:135,807888,346,778841,090,00030,003,00017,154,048
9Apr 28, 2026 09:135,816892,930,573842,450,00029,980,00017,154,048