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 listAug 27, 2026 22:08Elijah KinElijah KinScore: 2,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 22:082,03214,975,9363,835,0001,247,0002,117,632
2Aug 27, 2026 22:082,17115,238,5374,176,0001,253,0002,117,632
3Aug 27, 2026 22:082,23015,294,2874,322,0001,255,0002,117,632
4Aug 27, 2026 22:082,26715,584,3604,427,0001,242,0002,117,632
5Aug 27, 2026 22:082,29116,230,8794,487,0001,241,0002,117,632
6Aug 27, 2026 22:082,29415,861,5074,482,0001,254,0002,117,632
7Aug 27, 2026 22:082,31615,669,7854,539,0001,253,0002,117,632
8Aug 27, 2026 22:082,31615,556,7994,529,0001,263,0002,117,632
9Aug 27, 2026 22:082,31816,474,6534,534,0001,263,0002,117,632