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 14, 2026 01:00Victor MerckléVictor MerckléScore: 5,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 01:005,66023,371,41110,967,0003,183,0002,117,632
2Jun 14, 2026 01:005,66723,310,31711,001,0003,168,0002,117,632
3Jun 14, 2026 01:005,71923,472,15011,077,0003,222,0002,117,632
4Jun 14, 2026 01:005,83723,745,12411,288,0003,306,0002,117,632
5Jun 14, 2026 01:005,94124,004,47311,676,0003,178,0002,117,632
6Jun 14, 2026 01:006,00424,201,17611,836,0003,174,0002,117,632
7Jun 14, 2026 01:006,06824,386,77311,979,0003,191,0002,117,632
8Jun 14, 2026 01:006,17424,578,65712,238,0003,199,0002,117,632
9Jun 14, 2026 01:006,22124,782,37712,366,0003,187,0002,117,632