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 02:40Victor MerckléVictor MerckléScore: 5,807Success
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 02:405,45622,760,48810,507,0003,134,0002,117,632
2Jun 14, 2026 02:405,49222,879,82610,562,0003,170,0002,117,632
3Jun 14, 2026 02:405,67223,302,40811,000,0003,180,0002,117,632
4Jun 14, 2026 02:405,76923,593,28111,277,0003,146,0002,117,632
5Jun 14, 2026 02:405,80723,710,38611,371,0003,147,0002,117,632
6Jun 14, 2026 02:405,93723,980,31211,692,0003,151,0002,117,632
7Jun 14, 2026 02:406,02724,216,19811,928,0003,140,0002,117,632
8Jun 14, 2026 02:406,04024,288,82511,949,0003,153,0002,117,632
9Jun 14, 2026 02:406,12824,927,56412,180,0003,141,0002,117,632