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:59Victor MerckléVictor MerckléScore: 2,780Success
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 15:002,71616,637,7495,444,0001,346,0002,113,536
2May 20, 2026 15:002,71715,679,2105,445,0001,348,0002,113,536
3May 20, 2026 15:002,72514,788,9025,463,0001,350,0002,113,536
4May 20, 2026 15:002,74115,018,0025,489,0001,365,0002,113,536
5May 20, 2026 15:002,78015,756,1815,602,0001,348,0002,113,536
6May 20, 2026 15:002,80614,880,8215,651,0001,364,0002,113,536
7May 20, 2026 15:002,83115,494,2465,737,0001,342,0002,113,536
8May 20, 2026 15:002,83117,675,6975,738,0001,341,0002,113,536
9May 20, 2026 15:002,88315,009,3134,884,0002,324,0002,113,536