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 7, 2026 16:14Elijah KinElijah KinScore: 2,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 16:152,34814,845,5344,753,0001,118,0002,117,632
2Jun 7, 2026 16:152,37815,118,2954,832,0001,114,0002,117,632
3Jun 7, 2026 16:152,39115,001,3964,861,0001,117,0002,117,632
4Jun 7, 2026 16:152,39415,005,4044,867,0001,120,0002,117,632
5Jun 7, 2026 16:152,46015,718,7415,039,0001,112,0002,117,632
6Jun 7, 2026 16:152,46415,355,0185,052,0001,108,0002,117,632
7Jun 7, 2026 16:152,49515,348,1935,136,0001,103,0002,117,632
8Jun 7, 2026 16:152,49515,705,6835,132,0001,107,0002,117,632
9Jun 7, 2026 16:152,54315,346,7205,249,0001,109,0002,117,632