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 listDec 23, 2025 06:46AnSaAnSaScore: 1,168,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 06:461,168,8992,948,888,1992,919,249,0002,998,0002,330,624
2Dec 23, 2025 06:461,168,9662,949,576,3122,919,416,0002,998,0002,289,664
3Dec 23, 2025 06:461,169,2072,947,639,6442,922,019,000999,0002,322,432