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 4, 2026 02:56Elijah KinElijah KinScore: 2,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 02:592,53715,356,2365,230,0001,114,0002,117,632
2Jun 4, 2026 02:592,54015,340,3175,221,0001,129,0002,117,632
3Jun 4, 2026 02:592,55817,270,2005,250,0001,145,0002,117,632
4Jun 4, 2026 02:592,56815,433,8785,291,0001,129,0002,117,632
5Jun 4, 2026 02:592,57815,652,3745,290,0001,157,0002,117,632
6Jun 4, 2026 02:592,58517,126,5265,294,0001,169,0002,117,632
7Jun 4, 2026 02:592,64115,675,6085,451,0001,153,0002,117,632
8Jun 4, 2026 02:592,67516,164,4605,520,0001,168,0002,117,632
9Jun 4, 2026 02:592,73118,099,1515,633,0001,196,0002,117,632