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 listSep 14, 2026 14:37Victor MerckléVictor MerckléScore: 1,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 14:381,39212,329,5082,424,0001,056,0002,117,632stderr
2Sep 14, 2026 14:381,39612,288,7932,421,0001,071,0002,117,632stderr
3Sep 14, 2026 14:381,39812,295,7932,423,0001,073,0002,117,632stderr
4Sep 14, 2026 14:381,43512,331,4452,495,0001,094,0002,117,632stderr
5Sep 14, 2026 14:381,44012,294,5352,500,0001,102,0002,117,632stderr
6Sep 14, 2026 14:381,44912,425,8502,509,0001,114,0002,117,632stderr
7Sep 14, 2026 14:381,49612,515,2722,601,0001,141,0002,117,632stderr
8Sep 14, 2026 14:381,52212,528,9082,658,0001,147,0002,117,632stderr
9Sep 14, 2026 14:381,52612,447,3242,672,0001,143,0002,117,632stderr