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 7, 2026 04:44Elijah KinElijah KinScore: 2,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 04:452,23314,657,9854,472,0001,111,0002,117,632
2Jun 7, 2026 04:452,23514,713,2614,477,0001,111,0002,117,632
3Jun 7, 2026 04:452,24414,710,0244,495,0001,117,0002,117,632
4Jun 7, 2026 04:452,36514,995,6954,797,0001,116,0002,117,632
5Jun 7, 2026 04:452,51217,816,2105,176,0001,105,0002,117,632
6Jun 7, 2026 04:452,51415,281,3445,104,0001,183,0002,117,632
7Jun 7, 2026 04:452,52615,442,5805,214,0001,102,0002,117,632
8Jun 7, 2026 04:452,53415,360,8465,220,0001,116,0002,117,632
9Jun 7, 2026 04:452,55215,438,0995,276,0001,106,0002,117,632