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 09:10Victor MerckléVictor MerckléScore: 2,643Success
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 09:122,58217,678,9445,134,0001,323,0002,113,536
2May 30, 2026 09:122,58314,511,8445,137,0001,322,0002,113,536
3May 30, 2026 09:122,59015,132,5155,151,0001,324,0002,113,536
4May 30, 2026 09:122,59414,626,2455,160,0001,325,0002,113,536
5May 30, 2026 09:122,64315,015,0695,283,0001,325,0002,113,536
6May 30, 2026 09:122,69016,143,5055,400,0001,326,0002,113,536
7May 30, 2026 09:122,71814,587,1585,452,0001,344,0002,113,536
8May 30, 2026 09:122,72514,543,4685,475,0001,339,0002,113,536
9May 30, 2026 09:122,75916,883,3934,619,0002,280,0002,113,536