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:28Elijah KinElijah KinScore: 2,298Success
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:292,16015,221,3214,134,0001,268,0002,117,632
2Aug 27, 2026 21:292,26915,484,1014,406,0001,268,0002,117,632
3Aug 27, 2026 21:292,27515,419,4894,445,0001,244,0002,117,632
4Aug 27, 2026 21:292,29115,501,2024,472,0001,256,0002,117,632
5Aug 27, 2026 21:292,29815,546,4724,501,0001,246,0002,117,632
6Aug 27, 2026 21:292,29915,471,3394,492,0001,257,0002,117,632
7Aug 27, 2026 21:292,30215,551,4354,491,0001,264,0002,117,632
8Aug 27, 2026 21:292,33615,668,4274,745,0001,095,0002,117,632
9Aug 27, 2026 21:292,34915,738,4584,770,0001,103,0002,117,632