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 8, 2026 15:59Elijah KinElijah KinScore: 2,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 16:002,25214,725,8734,397,0001,234,0002,117,632
2Jun 8, 2026 16:002,40215,077,5634,763,0001,242,0002,117,632
3Jun 8, 2026 16:002,46915,186,2834,940,0001,234,0002,117,632
4Jun 8, 2026 16:002,49415,308,1094,997,0001,240,0002,117,632
5Jun 8, 2026 16:002,50215,370,2265,027,0001,228,0002,117,632
6Jun 8, 2026 16:002,52315,421,3765,072,0001,237,0002,117,632
7Jun 8, 2026 16:002,52815,381,2805,088,0001,234,0002,117,632
8Jun 8, 2026 16:002,56015,735,7905,155,0001,245,0002,117,632
9Jun 8, 2026 16:002,60315,953,5245,413,0001,096,0002,117,632