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 20:51Elijah KinElijah KinScore: 2,861Success
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 20:542,79115,971,9565,864,0001,115,0002,117,632
2Jun 3, 2026 20:542,81416,030,7745,910,0001,126,0002,117,632
3Jun 3, 2026 20:542,83616,077,1495,953,0001,139,0002,117,632
4Jun 3, 2026 20:542,85816,165,7295,993,0001,152,0002,117,632
5Jun 3, 2026 20:542,86116,285,0746,018,0001,136,0002,117,632
6Jun 3, 2026 20:542,88416,199,5696,066,0001,145,0002,117,632
7Jun 3, 2026 20:542,89016,339,5706,108,0001,117,0002,117,632
8Jun 3, 2026 20:542,95018,551,7046,199,0001,177,0002,117,632
9Jun 3, 2026 20:542,97516,881,9246,269,0001,170,0002,117,632