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 9, 2026 02:19Elijah KinElijah KinScore: 2,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 02:201,99614,125,8883,766,0001,226,0002,117,632
2Jun 9, 2026 02:202,00214,115,7293,774,0001,233,0002,117,632
3Jun 9, 2026 02:202,00614,169,0623,768,0001,249,0002,117,632
4Jun 9, 2026 02:202,01614,138,3653,750,0001,291,0002,117,632
5Jun 9, 2026 02:202,16614,449,2664,166,0001,250,0002,117,632
6Jun 9, 2026 02:202,22214,576,8764,450,0001,105,0002,117,632
7Jun 9, 2026 02:202,28814,809,2564,458,0001,263,0002,117,632
8Jun 9, 2026 02:202,30314,893,9954,508,0001,251,0002,117,632
9Jun 9, 2026 02:202,31514,828,6554,546,0001,242,0002,117,632