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 16, 2026 01:10Victor MerckléVictor MerckléScore: 1,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 01:131,72611,705,8163,101,0001,216,0002,113,536
2Jun 16, 2026 01:131,73112,875,9433,104,0001,225,0002,113,536
3Jun 16, 2026 01:131,75511,738,0543,166,0001,223,0002,113,536
4Jun 16, 2026 01:131,78711,848,6173,232,0001,237,0002,113,536
5Jun 16, 2026 01:131,83112,035,7143,366,0001,212,0002,113,536
6Jun 16, 2026 01:131,83712,054,4143,375,0001,219,0002,113,536
7Jun 16, 2026 01:131,85311,993,8033,370,0001,264,0002,113,536
8Jun 16, 2026 01:131,87812,075,0653,342,0001,353,0002,113,536
9Jun 16, 2026 01:131,89612,139,6433,496,0001,245,0002,113,536