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 10, 2026 02:57Elijah KinElijah KinScore: 2,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 02:582,37614,920,7524,724,0001,218,0002,117,632
2Jun 10, 2026 02:582,38115,028,7694,723,0001,231,0002,117,632
3Jun 10, 2026 02:582,38415,022,4774,725,0001,235,0002,117,632
4Jun 10, 2026 02:582,41314,985,5424,806,0001,227,0002,117,632
5Jun 10, 2026 02:582,51815,227,2665,062,0001,234,0002,117,632
6Jun 10, 2026 02:582,54615,384,6445,131,0001,234,0002,117,632
7Jun 10, 2026 02:582,62815,533,8445,350,0001,220,0002,117,632
8Jun 10, 2026 02:582,68225,748,2145,450,0001,255,0002,113,536
9Jun 10, 2026 02:582,69215,754,3615,486,0001,244,0002,117,632