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 27, 2026 01:46Victor MerckléVictor MerckléScore: 3,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 01:493,33817,333,2335,557,0002,789,0002,138,112
2Jun 27, 2026 01:493,35717,362,9245,562,0002,832,0002,134,016
3Jun 27, 2026 01:493,36417,397,9125,592,0002,820,0002,129,920
4Jun 27, 2026 01:493,43417,619,5845,586,0003,001,0002,129,920
5Jun 27, 2026 01:493,43517,609,2276,095,0002,494,0002,138,112
6Jun 27, 2026 01:493,44617,648,8566,149,0002,467,0002,138,112
7Jun 27, 2026 01:493,47817,713,0765,056,0003,641,0002,150,400
8Jun 27, 2026 01:493,53417,793,7145,946,0002,889,0002,129,920
9Jun 27, 2026 01:493,57017,899,4235,370,0003,557,0002,138,112