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 listAug 27, 2026 17:43Elijah KinElijah KinScore: 2,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:442,00814,735,9533,788,0001,234,0002,117,632
2Aug 27, 2026 17:442,21115,293,0594,251,0001,278,0002,117,632
3Aug 27, 2026 17:442,25015,380,0934,372,0001,253,0002,117,632
4Aug 27, 2026 17:442,28015,524,9664,467,0001,235,0002,117,632
5Aug 27, 2026 17:442,29216,214,7034,479,0001,252,0002,117,632
6Aug 27, 2026 17:442,30616,261,8624,502,0001,265,0002,117,632
7Aug 27, 2026 17:442,31116,214,6554,533,0001,246,0002,117,632
8Aug 27, 2026 17:442,31215,592,7304,685,0001,097,0002,117,632
9Aug 27, 2026 17:442,33915,595,3714,530,0001,318,0002,117,632