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 06:46Elijah KinElijah KinScore: 10,358Success
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 06:4610,18934,763,17521,265,0004,209,0002,117,632
2Jun 3, 2026 06:4610,19834,685,07321,299,0004,196,0002,117,632
3Jun 3, 2026 06:4610,32235,042,79821,457,0004,350,0002,117,632
4Jun 3, 2026 06:4610,34235,165,79621,649,0004,207,0002,117,632
5Jun 3, 2026 06:4610,35835,438,48921,695,0004,202,0002,117,632
6Jun 3, 2026 06:4610,38635,559,38621,711,0004,254,0002,117,632
7Jun 3, 2026 06:4610,42235,700,02221,750,0004,306,0002,117,632
8Jun 3, 2026 06:4610,43435,768,37221,762,0004,325,0002,117,632
9Jun 3, 2026 06:4610,49935,917,83022,009,0004,239,0002,117,632