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 listMay 20, 2026 14:47Victor MerckléVictor MerckléScore: 2,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:482,68115,379,7075,354,0001,350,0002,113,536
2May 20, 2026 14:482,69616,484,6265,387,0001,353,0002,113,536
3May 20, 2026 14:482,75316,050,9775,495,0001,388,0002,113,536
4May 20, 2026 14:482,75515,450,6225,502,0001,387,0002,113,536
5May 20, 2026 14:482,79016,653,5935,631,0001,344,0002,113,536
6May 20, 2026 14:482,82014,882,0875,702,0001,348,0002,113,536
7May 20, 2026 14:482,83018,089,0805,727,0001,349,0002,113,536
8May 20, 2026 14:482,83417,759,9445,735,0001,350,0002,113,536
9May 20, 2026 14:482,83916,584,9305,735,0001,363,0002,113,536