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 27, 2026 04:50Elijah KinElijah KinScore: 2,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 04:512,02514,162,9403,818,0001,245,0002,117,632
2Jun 27, 2026 04:512,18114,528,6004,200,0001,253,0002,117,632
3Jun 27, 2026 04:512,21314,686,8744,263,0001,270,0002,117,632
4Jun 27, 2026 04:512,26615,177,3384,406,0001,260,0002,117,632
5Jun 27, 2026 04:512,28614,811,3904,468,0001,247,0002,117,632
6Jun 27, 2026 04:512,28714,823,4074,448,0001,271,0002,117,632
7Jun 27, 2026 04:512,29214,870,1344,477,0001,255,0002,117,632
8Jun 27, 2026 04:512,29414,866,8914,481,0001,254,0002,117,632
9Jun 27, 2026 04:512,30016,600,0744,479,0001,273,0002,117,632