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:55Victor MerckléVictor MerckléScore: 2,610Success
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:572,52313,882,9014,977,0001,332,0002,113,536
2Jun 1, 2026 15:572,55714,017,7055,065,0001,329,0002,113,536
3Jun 1, 2026 15:572,56113,927,1685,048,0001,356,0002,113,536
4Jun 1, 2026 15:572,58813,969,1175,145,0001,327,0002,113,536
5Jun 1, 2026 15:572,61014,085,9635,197,0001,330,0002,113,536
6Jun 1, 2026 15:572,62114,215,2985,220,0001,333,0002,113,536
7Jun 1, 2026 15:572,63614,025,6395,247,0001,345,0002,113,536
8Jun 1, 2026 15:572,64614,163,0525,276,0001,339,0002,113,536
9Jun 1, 2026 15:572,64814,213,6045,297,0001,325,0002,113,536