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 15:20Elijah KinElijah KinScore: 2,657Success
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 15:212,52015,353,3065,202,0001,099,0002,117,632
2Jun 7, 2026 15:212,53215,605,1535,223,0001,109,0002,117,632
3Jun 7, 2026 15:212,53215,772,9025,224,0001,106,0002,117,632
4Jun 7, 2026 15:212,57215,551,6675,280,0001,152,0002,117,632
5Jun 7, 2026 15:212,65715,662,3355,541,0001,102,0002,117,632
6Jun 7, 2026 15:212,67515,762,9445,584,0001,105,0002,117,632
7Jun 7, 2026 15:212,76816,066,4635,828,0001,092,0002,117,632
8Jun 7, 2026 15:212,79816,131,6295,899,0001,098,0002,117,632
9Jun 7, 2026 15:212,86016,224,3006,048,0001,103,0002,117,632