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 18:33Elijah KinElijah KinScore: 2,778Success
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 18:342,70415,874,3695,634,0001,126,0002,117,632
2Jun 3, 2026 18:342,71717,733,1415,655,0001,138,0002,117,632
3Jun 3, 2026 18:342,73015,845,8165,692,0001,135,0002,117,632
4Jun 3, 2026 18:342,73815,975,9985,640,0001,205,0002,117,632
5Jun 3, 2026 18:342,77815,967,9135,778,0001,168,0002,117,632
6Jun 3, 2026 18:342,79417,635,3115,845,0001,140,0002,117,632
7Jun 3, 2026 18:342,86016,475,3965,958,0001,194,0002,117,632
8Jun 3, 2026 18:342,86116,584,9105,969,0001,185,0002,117,632
9Jun 3, 2026 18:342,88716,688,9606,029,0001,190,0002,117,632