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 07:01Elijah KinElijah KinScore: 10,412Success
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 07:0110,13434,575,55821,097,0004,239,0002,117,632
2Jun 3, 2026 07:0110,13834,586,57121,141,0004,206,0002,117,632
3Jun 3, 2026 07:0110,19834,647,18821,287,0004,210,0002,117,632
4Jun 3, 2026 07:0110,21834,803,41921,295,0004,250,0002,117,632
5Jun 3, 2026 07:0110,41235,627,89421,821,0004,210,0002,117,632
6Jun 3, 2026 07:0110,44835,780,20721,844,0004,276,0002,117,632
7Jun 3, 2026 07:0110,51435,524,47721,882,0004,403,0002,117,632
8Jun 3, 2026 07:0111,34138,048,95524,168,0004,186,0002,117,632
9Jun 3, 2026 07:0111,39038,185,74224,218,0004,257,0002,117,632