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 03:09Elijah KinElijah KinScore: 2,586Success
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 03:122,46715,159,5215,029,0001,139,0002,117,632
2Jun 4, 2026 03:122,47615,322,4935,029,0001,161,0002,117,632
3Jun 4, 2026 03:122,54716,999,4275,168,0001,200,0002,117,632
4Jun 4, 2026 03:122,58415,471,5635,297,0001,165,0002,117,632
5Jun 4, 2026 03:122,58616,874,7285,305,0001,160,0002,117,632
6Jun 4, 2026 03:122,59515,505,6495,339,0001,149,0002,117,632
7Jun 4, 2026 03:122,59717,641,0915,332,0001,161,0002,117,632
8Jun 4, 2026 03:122,61616,049,2985,387,0001,155,0002,117,632
9Jun 4, 2026 03:122,72616,071,9715,626,0001,189,0002,117,632