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 06:03Elijah KinElijah KinScore: 2,606Success
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 06:042,52415,354,4075,192,0001,119,0002,117,632
2Jun 4, 2026 06:042,53915,402,2655,208,0001,141,0002,117,632
3Jun 4, 2026 06:042,58915,444,1625,339,0001,134,0002,117,632
4Jun 4, 2026 06:042,60415,757,2385,383,0001,128,0002,117,632
5Jun 4, 2026 06:042,60615,639,4235,396,0001,120,0002,117,632
6Jun 4, 2026 06:042,63316,175,3035,433,0001,150,0002,117,632
7Jun 4, 2026 06:042,66416,001,5535,515,0001,147,0002,117,632
8Jun 4, 2026 06:042,66916,192,0195,534,0001,139,0002,117,632
9Jun 4, 2026 06:042,70916,215,2065,610,0001,163,0002,117,632