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 listFeb 16, 2026 16:54Valentin KofmanValentin KofmanScore: 4,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 16:544,224660,674,097622,671,00010,994,00016,961,536
2Feb 16, 2026 16:544,229661,158,035625,302,0008,989,00017,182,720
3Feb 16, 2026 16:544,231658,007,608624,604,0009,993,00017,035,264
4Feb 16, 2026 16:544,236658,794,378626,345,0009,004,00016,998,400
5Feb 16, 2026 16:544,247660,721,306626,024,00011,000,00017,182,720
6Feb 16, 2026 16:544,248659,841,152626,166,00011,002,00017,022,976
7Feb 16, 2026 16:544,248665,927,896627,267,00010,004,00017,186,816
8Feb 16, 2026 16:544,270665,568,314632,462,0008,005,00017,182,720
9Feb 16, 2026 16:544,272664,813,375628,740,00011,995,00017,186,816