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:23TudyMTudyMScore: 6,597Success
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:256,5741,003,205,181955,137,00030,972,00017,002,496
2Apr 28, 2026 08:256,5771,006,923,388954,632,00031,987,00017,141,760
3Apr 28, 2026 08:256,5771,006,869,462957,695,00028,990,00017,158,144
4Apr 28, 2026 08:256,5801,007,347,744955,089,00031,969,00017,149,952
5Apr 28, 2026 08:256,5971,012,160,256960,677,00028,990,00017,149,952
6Apr 28, 2026 08:256,6121,011,754,631953,893,00037,995,00017,137,664
7Apr 28, 2026 08:256,6201,010,955,230957,178,00035,969,00017,137,664
8Apr 28, 2026 08:256,6271,011,930,813961,148,00032,970,00017,235,968
9Apr 28, 2026 08:256,6351,012,531,964966,298,00028,978,00017,211,392