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 1, 2026 15:33Victor MerckléVictor MerckléScore: 2,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 15:352,49413,825,9524,906,0001,330,0002,113,536
2Jun 1, 2026 15:352,50213,845,3494,922,0001,333,0002,113,536
3Jun 1, 2026 15:352,50514,620,5444,935,0001,328,0002,113,536
4Jun 1, 2026 15:352,56413,967,9345,077,0001,335,0002,113,536
5Jun 1, 2026 15:352,58913,962,1415,144,0001,330,0002,113,536
6Jun 1, 2026 15:352,60214,028,9075,176,0001,329,0002,113,536
7Jun 1, 2026 15:352,60514,037,7955,361,0001,152,0002,113,536
8Jun 1, 2026 15:352,60814,006,3005,187,0001,335,0002,113,536
9Jun 1, 2026 15:352,61614,030,3185,207,0001,333,0002,113,536