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 29, 2026 17:54Victor MerckléVictor MerckléScore: 2,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 17:562,56814,097,0455,106,0001,314,0002,113,536
2May 29, 2026 17:562,57315,975,9425,117,0001,316,0002,113,536
3May 29, 2026 17:562,57416,463,1705,120,0001,316,0002,113,536
4May 29, 2026 17:562,58214,105,4125,139,0001,316,0002,113,536
5May 29, 2026 17:562,62316,640,1975,214,0001,344,0002,113,536
6May 29, 2026 17:562,63214,966,8165,231,0001,350,0002,113,536
7May 29, 2026 17:562,68714,897,7665,399,0001,319,0002,113,536
8May 29, 2026 17:562,70014,579,4635,444,0001,307,0002,113,536
9May 29, 2026 17:562,70616,136,3035,457,0001,309,0002,113,536