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 08:35TudyMTudyMScore: 5,888Success
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 08:365,679870,827,753821,889,00029,995,00017,178,624
2Apr 28, 2026 08:365,702873,171,267819,358,00035,971,00017,141,760
3Apr 28, 2026 08:365,730876,906,409827,546,00031,982,00017,145,856
4Apr 28, 2026 08:365,755882,987,202828,356,00034,972,00017,235,968
5Apr 28, 2026 08:365,888898,208,530853,339,00029,976,00017,125,376
6Apr 28, 2026 08:365,917905,779,621850,705,00036,987,00017,190,912
7Apr 28, 2026 08:365,974913,165,787865,160,00030,969,00017,145,856
8Apr 28, 2026 08:365,975912,631,283865,420,00030,979,00017,137,664
9Apr 28, 2026 08:365,995918,291,654865,407,00033,976,00017,145,856