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 3, 2026 15:46Elijah KinElijah KinScore: 3,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 15:483,71618,546,2838,100,0001,191,0002,121,728
2Jun 3, 2026 15:483,71618,609,3678,098,0001,194,0002,121,728
3Jun 3, 2026 15:483,73620,337,7568,229,0001,112,0002,117,632
4Jun 3, 2026 15:483,76318,674,0738,294,0001,115,0002,117,632
5Jun 3, 2026 15:483,86519,313,0108,553,0001,110,0002,121,728
6Jun 3, 2026 15:483,86619,292,9548,553,0001,114,0002,117,632
7Jun 3, 2026 15:483,91919,461,0578,678,0001,120,0002,121,728
8Jun 3, 2026 15:483,92219,461,7058,694,0001,113,0002,117,632
9Jun 3, 2026 15:483,92819,482,9897,775,0002,045,0002,117,632