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 30, 2026 01:54Victor MerckléVictor MerckléScore: 2,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 01:562,52115,679,1224,978,0001,326,0002,113,536
2May 30, 2026 01:562,52415,546,3814,986,0001,326,0002,113,536
3May 30, 2026 01:562,52614,095,2854,989,0001,328,0002,113,536
4May 30, 2026 01:562,54415,485,6895,032,0001,329,0002,113,536
5May 30, 2026 01:562,54515,011,2315,030,0001,334,0002,113,536
6May 30, 2026 01:562,55815,483,7725,048,0001,347,0002,113,536
7May 30, 2026 01:562,56014,683,4355,052,0001,348,0002,113,536
8May 30, 2026 01:562,58615,903,4395,137,0001,329,0002,113,536
9May 30, 2026 01:562,66017,208,7145,300,0001,352,0002,113,536