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 21:11Elijah KinElijah KinScore: 2,268Success
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 21:122,01314,924,5463,783,0001,251,0002,117,632
2Aug 27, 2026 21:122,13615,239,6904,088,0001,252,0002,117,632
3Aug 27, 2026 21:122,16515,257,4234,298,0001,115,0002,117,632
4Aug 27, 2026 21:122,20315,234,0164,262,0001,247,0002,117,632
5Aug 27, 2026 21:122,26815,467,2494,410,0001,260,0002,117,632
6Aug 27, 2026 21:122,28215,510,8434,444,0001,261,0002,117,632
7Aug 27, 2026 21:122,28815,510,9444,460,0001,262,0002,117,632
8Aug 27, 2026 21:122,29415,546,1484,494,0001,243,0002,117,632
9Aug 27, 2026 21:122,29915,434,0094,497,0001,252,0002,117,632