Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listMay 20, 2026 13:27Victor MerckléVictor MerckléScore: 2,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 13:282,74815,222,4015,736,0001,136,0002,113,536
2May 20, 2026 13:282,74814,646,9115,733,0001,138,0002,113,536
3May 20, 2026 13:282,76716,205,0375,776,0001,142,0002,113,536
4May 20, 2026 13:282,78915,847,1835,834,0001,139,0002,113,536
5May 20, 2026 13:282,80114,770,8785,867,0001,137,0002,113,536
6May 20, 2026 13:282,84916,040,3975,975,0001,149,0002,113,536
7May 20, 2026 13:282,85916,230,8716,014,0001,135,0002,113,536
8May 20, 2026 13:282,91015,019,4996,114,0001,161,0002,113,536
9May 20, 2026 13:282,91515,026,9676,129,0001,159,0002,113,536