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 09:54Victor MerckléVictor MerckléScore: 2,595Success
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 09:562,50213,767,9984,932,0001,323,0002,113,536
2Jun 1, 2026 09:562,51213,926,0684,953,0001,327,0002,113,536
3Jun 1, 2026 09:562,51413,857,8674,958,0001,327,0002,113,536
4Jun 1, 2026 09:562,51513,899,8284,965,0001,324,0002,113,536
5Jun 1, 2026 09:562,59513,985,9785,170,0001,319,0002,113,536
6Jun 1, 2026 09:562,60614,015,5195,196,0001,320,0002,113,536
7Jun 1, 2026 09:562,61014,000,2735,203,0001,323,0002,113,536
8Jun 1, 2026 09:562,61514,063,3155,216,0001,323,0002,113,536
9Jun 1, 2026 09:562,62414,375,0505,235,0001,325,0002,113,536