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 3, 2026 06:31Elijah KinElijah KinScore: 6,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 06:316,02824,317,38210,812,0004,259,0002,117,632
2Jun 3, 2026 06:316,03424,288,46110,928,0004,158,0002,117,632
3Jun 3, 2026 06:316,04324,338,67410,838,0004,270,0002,117,632
4Jun 3, 2026 06:316,04324,303,64710,840,0004,268,0002,117,632
5Jun 3, 2026 06:316,06624,432,96310,973,0004,194,0002,117,632
6Jun 3, 2026 06:316,10724,602,77711,105,0004,164,0002,121,728
7Jun 3, 2026 06:316,41125,631,73911,769,0004,259,0002,117,632
8Jun 3, 2026 06:316,49025,473,67911,976,0004,251,0002,117,632
9Jun 3, 2026 06:316,56326,116,49712,122,0004,286,0002,117,632