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 13, 2026 13:25Victor MerckléVictor MerckléScore: 61,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 13:2661,025161,630,886148,452,0004,111,0002,117,632
2Jun 13, 2026 13:2661,052161,715,995149,601,0003,031,0002,117,632
3Jun 13, 2026 13:2661,058161,788,118149,612,0003,033,0002,117,632
4Jun 13, 2026 13:2661,130161,896,314148,793,0004,034,0002,117,632
5Jun 13, 2026 13:2661,150162,050,587149,844,0003,031,0002,117,632
6Jun 13, 2026 13:2661,251162,215,051150,095,0003,034,0002,117,632
7Jun 13, 2026 13:2661,322162,438,157149,265,0004,040,0002,117,632
8Jun 13, 2026 13:2661,451162,716,709150,597,0003,032,0002,117,632
9Jun 13, 2026 13:2662,378165,175,954151,865,0004,082,0002,117,632