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 21:55Elijah KinElijah KinScore: 2,266Success
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 21:582,06014,225,9393,910,0001,240,0002,117,632
2Jun 8, 2026 21:582,07514,363,2183,941,0001,248,0002,117,632
3Jun 8, 2026 21:582,22514,635,4924,320,0001,243,0002,117,632
4Jun 8, 2026 21:582,25814,697,1764,385,0001,262,0002,117,632
5Jun 8, 2026 21:582,26614,699,8344,414,0001,251,0002,117,632
6Jun 8, 2026 21:582,28614,827,2784,493,0001,223,0002,117,632
7Jun 8, 2026 21:582,29514,734,2784,517,0001,222,0002,117,632
8Jun 8, 2026 21:582,37915,048,5534,698,0001,251,0002,117,632
9Jun 8, 2026 21:582,39214,993,4164,724,0001,258,0002,117,632