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:07Victor MerckléVictor MerckléScore: 5,795Success
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:075,75323,621,79411,168,0003,216,0002,117,632
2Jun 14, 2026 01:075,75423,492,36411,183,0003,202,0002,117,632
3Jun 14, 2026 01:075,76123,563,58911,195,0003,209,0002,117,632
4Jun 14, 2026 01:075,79123,616,67611,258,0003,220,0002,117,632
5Jun 14, 2026 01:075,79523,618,26411,281,0003,207,0002,117,632
6Jun 14, 2026 01:075,83123,763,41311,314,0003,264,0002,117,632
7Jun 14, 2026 01:076,07824,331,99311,974,0003,222,0002,117,632
8Jun 14, 2026 01:076,10224,491,72612,039,0003,218,0002,117,632
9Jun 14, 2026 01:076,25124,717,06312,443,0003,185,0002,117,632