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 5, 2026 23:32Elijah KinElijah KinScore: 2,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 23:342,44715,143,6205,000,0001,119,0002,117,632
2Jun 5, 2026 23:342,45415,186,5915,015,0001,120,0002,117,632
3Jun 5, 2026 23:342,47615,197,0205,067,0001,125,0002,117,632
4Jun 5, 2026 23:342,52615,367,3605,197,0001,119,0002,117,632
5Jun 5, 2026 23:342,64715,662,1085,506,0001,113,0002,117,632
6Jun 5, 2026 23:342,68315,699,1405,582,0001,127,0002,117,632
7Jun 5, 2026 23:342,69515,732,7645,614,0001,124,0002,117,632
8Jun 5, 2026 23:342,72516,361,9975,680,0001,133,0002,117,632
9Jun 5, 2026 23:342,74215,842,7735,724,0001,131,0002,117,632