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 listJun 8, 2026 03:12Elijah KinElijah KinScore: 2,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 03:122,12414,377,6094,042,0001,268,0002,117,632
2Jun 8, 2026 03:122,29114,710,2014,440,0001,288,0002,117,632
3Jun 8, 2026 03:122,32214,833,3404,530,0001,275,0002,117,632
4Jun 8, 2026 03:122,33714,892,0234,539,0001,304,0002,117,632
5Jun 8, 2026 03:122,36415,005,0124,754,0001,156,0002,117,632
6Jun 8, 2026 03:122,39115,062,4324,683,0001,296,0002,117,632
7Jun 8, 2026 03:122,40415,003,5974,713,0001,298,0002,117,632
8Jun 8, 2026 03:122,45615,645,8004,853,0001,289,0002,117,632
9Jun 8, 2026 03:122,45615,215,7765,003,0001,137,0002,117,632