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 10, 2026 05:02Victor MerckléVictor MerckléScore: 3,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 05:083,17915,481,0545,445,0002,504,0002,113,536
2Jun 10, 2026 05:083,20015,513,6675,437,0002,564,0002,113,536
3Jun 10, 2026 05:083,26015,676,2765,622,0002,530,0002,113,536
4Jun 10, 2026 05:083,34015,852,8975,849,0002,501,0002,113,536
5Jun 10, 2026 05:083,35515,936,1835,849,0002,540,0002,113,536
6Jun 10, 2026 05:083,41216,041,6205,993,0002,537,0002,113,536
7Jun 10, 2026 05:083,43916,078,3086,051,0002,547,0002,113,536
8Jun 10, 2026 05:083,46816,221,5326,070,0002,601,0002,113,536
9Jun 10, 2026 05:083,50716,232,6366,333,0002,435,0002,113,536