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 11:30Victor MerckléVictor MerckléScore: 2,607Success
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 11:322,51013,845,8634,951,0001,324,0002,113,536
2Jun 1, 2026 11:322,51313,912,2954,957,0001,327,0002,113,536
3Jun 1, 2026 11:322,52413,844,8574,982,0001,330,0002,113,536
4Jun 1, 2026 11:322,53613,898,5355,000,0001,341,0002,113,536
5Jun 1, 2026 11:322,60714,061,8845,202,0001,317,0002,113,536
6Jun 1, 2026 11:322,61814,068,2895,222,0001,325,0002,113,536
7Jun 1, 2026 11:322,62114,037,5775,229,0001,324,0002,113,536
8Jun 1, 2026 11:322,62214,159,6005,229,0001,327,0002,113,536
9Jun 1, 2026 11:322,64514,269,0744,254,0002,360,0002,113,536