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 3, 2026 07:26Elijah KinElijah KinScore: 5,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 07:275,11521,770,72310,567,0002,221,0002,113,536
2Jun 3, 2026 07:275,11821,850,24510,574,0002,222,0002,113,536
3Jun 3, 2026 07:275,14821,860,76210,637,0002,233,0002,113,536
4Jun 3, 2026 07:275,19521,978,2649,817,0003,172,0002,113,536
5Jun 3, 2026 07:275,24022,083,1149,964,0003,137,0002,113,536
6Jun 3, 2026 07:275,25622,132,33510,920,0002,220,0002,113,536
7Jun 3, 2026 07:275,47123,119,78010,435,0003,244,0002,113,536
8Jun 3, 2026 07:275,52623,282,38010,693,0003,122,0002,113,536
9Jun 3, 2026 07:275,54622,827,23910,698,0003,167,0002,113,536