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 18:22Elijah KinElijah KinScore: 2,281Success
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 18:222,02914,915,1583,832,0001,241,0002,117,632
2Aug 27, 2026 18:222,19115,316,4454,234,0001,245,0002,117,632
3Aug 27, 2026 18:222,20115,433,9444,256,0001,247,0002,117,632
4Aug 27, 2026 18:222,26415,424,5874,396,0001,265,0002,117,632
5Aug 27, 2026 18:222,28115,532,8224,453,0001,251,0002,117,632
6Aug 27, 2026 18:222,28615,459,3604,463,0001,253,0002,117,632
7Aug 27, 2026 18:222,28915,516,6754,627,0001,097,0002,117,632
8Aug 27, 2026 18:222,32215,575,0954,543,0001,263,0002,117,632
9Aug 27, 2026 18:222,34415,676,8864,753,0001,108,0002,117,632