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 15, 2026 20:09Victor MerckléVictor MerckléScore: 1,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 20:121,73411,667,3963,114,0001,221,0002,113,536
2Jun 15, 2026 20:121,73411,700,2803,113,0001,222,0002,113,536
3Jun 15, 2026 20:121,73511,692,7343,117,0001,222,0002,113,536
4Jun 15, 2026 20:121,84911,934,3363,353,0001,270,0002,113,536
5Jun 15, 2026 20:121,85911,970,4593,435,0001,214,0002,113,536
6Jun 15, 2026 20:121,86112,011,2433,434,0001,220,0002,113,536
7Jun 15, 2026 20:121,87212,051,6723,457,0001,225,0002,113,536
8Jun 15, 2026 20:121,87812,047,4013,459,0001,237,0002,113,536
9Jun 15, 2026 20:121,95512,223,9493,447,0001,442,0002,113,536