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 20:15Victor MerckléVictor MerckléScore: 2,677Success
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 20:162,56914,262,1295,220,0001,203,0002,113,536
2Jun 1, 2026 20:162,57413,872,3015,232,0001,205,0002,113,536
3Jun 1, 2026 20:162,65114,046,4935,422,0001,207,0002,113,536
4Jun 1, 2026 20:162,67514,136,6805,479,0001,210,0002,113,536
5Jun 1, 2026 20:162,67714,281,8625,485,0001,209,0002,113,536
6Jun 1, 2026 20:162,67814,519,8745,488,0001,207,0002,113,536
7Jun 1, 2026 20:162,67814,309,1925,486,0001,210,0002,113,536
8Jun 1, 2026 20:162,69214,163,6675,507,0001,223,0002,113,536
9Jun 1, 2026 20:162,72514,243,9924,700,0002,113,0002,113,536