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 15:29Elijah KinElijah KinScore: 3,608Success
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 15:303,50217,831,4717,623,0001,132,0002,117,632
2Jun 3, 2026 15:303,52817,753,3737,692,0001,129,0002,117,632
3Jun 3, 2026 15:303,53318,983,2847,696,0001,138,0002,117,632
4Jun 3, 2026 15:303,59817,979,4637,860,0001,137,0002,117,632
5Jun 3, 2026 15:303,60818,136,0317,870,0001,151,0002,117,632
6Jun 3, 2026 15:303,61618,073,5327,891,0001,150,0002,117,632
7Jun 3, 2026 15:303,66619,819,0238,004,0001,162,0002,117,632
8Jun 3, 2026 15:303,68118,323,1478,037,0001,166,0002,117,632
9Jun 3, 2026 15:303,69318,660,2718,047,0001,186,0002,117,632