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 7, 2026 01:14Elijah KinElijah KinScore: 2,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 01:152,60915,812,9805,423,0001,101,0002,117,632
2Jun 7, 2026 01:152,62815,661,5095,463,0001,108,0002,117,632
3Jun 7, 2026 01:152,64016,041,7325,498,0001,102,0002,117,632
4Jun 7, 2026 01:152,65415,624,9865,527,0001,108,0002,117,632
5Jun 7, 2026 01:152,67015,745,6035,575,0001,102,0002,117,632
6Jun 7, 2026 01:152,68115,697,6915,594,0001,109,0002,117,632
7Jun 7, 2026 01:152,68815,698,0075,621,0001,101,0002,117,632
8Jun 7, 2026 01:152,69816,236,4385,638,0001,108,0002,117,632
9Jun 7, 2026 01:152,71015,821,0615,675,0001,100,0002,117,632