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 23:51Elijah KinElijah KinScore: 2,813Success
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 23:512,73615,971,6945,531,0001,309,0002,117,632
2Jun 8, 2026 23:512,77616,022,8665,630,0001,311,0002,117,632
3Jun 8, 2026 23:512,78816,068,2455,675,0001,295,0002,117,632
4Jun 8, 2026 23:512,79416,197,7885,660,0001,327,0002,117,632
5Jun 8, 2026 23:512,81316,092,4145,734,0001,300,0002,117,632
6Jun 8, 2026 23:512,82316,213,5795,742,0001,317,0002,117,632
7Jun 8, 2026 23:512,82616,101,3605,778,0001,287,0002,117,632
8Jun 8, 2026 23:512,83316,441,5145,773,0001,310,0002,117,632
9Jun 8, 2026 23:512,84016,256,8245,792,0001,310,0002,117,632