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 8, 2026 21:48Elijah KinElijah KinScore: 2,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 21:522,19114,520,0414,221,0001,257,0002,117,632
2Jun 8, 2026 21:522,22814,691,7954,275,0001,295,0002,117,632
3Jun 8, 2026 21:522,28014,817,4874,403,0001,298,0002,117,632
4Jun 8, 2026 21:522,28914,799,3764,449,0001,274,0002,117,632
5Jun 8, 2026 21:522,44315,192,4324,822,0001,287,0002,117,632
6Jun 8, 2026 21:522,46115,163,9224,860,0001,294,0002,117,632
7Jun 8, 2026 21:522,49915,247,2234,978,0001,270,0002,117,632
8Jun 8, 2026 21:522,51115,336,7684,991,0001,288,0002,117,632
9Jun 8, 2026 21:522,52615,357,1495,043,0001,273,0002,117,632