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 8, 2026 02:17Elijah KinElijah KinScore: 2,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:182,10814,221,8683,992,0001,278,0002,117,632
2Jun 8, 2026 02:182,23814,778,1054,323,0001,274,0002,117,632
3Jun 8, 2026 02:182,26714,697,6394,388,0001,281,0002,117,632
4Jun 8, 2026 02:182,27714,731,3004,411,0001,282,0002,117,632
5Jun 8, 2026 02:182,29014,844,7454,455,0001,271,0002,117,632
6Jun 8, 2026 02:182,29415,115,6594,466,0001,271,0002,117,632
7Jun 8, 2026 02:182,36614,954,3974,650,0001,265,0002,117,632
8Jun 8, 2026 02:182,38315,037,4104,682,0001,277,0002,117,632
9Jun 8, 2026 02:182,38915,065,3674,683,0001,291,0002,117,632