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 9, 2026 04:54Elijah KinElijah KinScore: 2,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 04:542,03814,261,5673,889,0001,207,0002,117,632
2Jun 9, 2026 04:542,03914,200,3593,892,0001,207,0002,117,632
3Jun 9, 2026 04:542,05214,244,5323,931,0001,199,0002,117,632
4Jun 9, 2026 04:542,05514,287,4743,922,0001,217,0002,117,632
5Jun 9, 2026 04:542,20214,667,3824,323,0001,182,0002,117,632
6Jun 9, 2026 04:542,30214,833,2244,558,0001,197,0002,117,632
7Jun 9, 2026 04:542,34914,969,9864,669,0001,205,0002,117,632
8Jun 9, 2026 04:542,35015,003,5824,683,0001,193,0002,117,632
9Jun 9, 2026 04:542,38515,125,5284,770,0001,193,0002,117,632