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 03:53Elijah KinElijah KinScore: 2,192Success
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 03:542,05014,242,5483,905,0001,222,0002,117,632
2Jun 9, 2026 03:542,05814,267,1493,935,0001,212,0002,117,632
3Jun 9, 2026 03:542,06815,564,6883,930,0001,240,0002,117,632
4Jun 9, 2026 03:542,07025,727,5913,913,0001,264,0002,113,536
5Jun 9, 2026 03:542,19214,540,4734,264,0001,217,0002,117,632
6Jun 9, 2026 03:542,20214,641,0274,314,0001,193,0002,117,632
7Jun 9, 2026 03:542,30814,795,8584,581,0001,189,0002,117,632
8Jun 9, 2026 03:542,31314,919,2094,586,0001,197,0002,117,632
9Jun 9, 2026 03:542,32214,921,4234,604,0001,201,0002,117,632