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 4, 2026 20:13Elijah KinElijah KinScore: 2,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 20:142,55015,382,1505,288,0001,089,0002,117,632
2Jun 4, 2026 20:142,57915,455,6145,347,0001,101,0002,117,632
3Jun 4, 2026 20:142,57915,510,9225,352,0001,097,0002,117,632
4Jun 4, 2026 20:142,59215,433,0995,365,0001,116,0002,117,632
5Jun 4, 2026 20:142,61315,567,6255,420,0001,113,0002,117,632
6Jun 4, 2026 20:142,61415,542,5575,406,0001,130,0002,117,632
7Jun 4, 2026 20:142,74615,911,3385,735,0001,132,0002,117,632
8Jun 4, 2026 20:142,78816,528,9165,806,0001,165,0002,117,632
9Jun 4, 2026 20:142,79016,002,5515,856,0001,121,0002,117,632