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:37Victor MerckléVictor MerckléScore: 3,487Success
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:403,43417,646,2625,051,0003,534,0002,187,264
2Jun 27, 2026 01:403,46217,618,8526,178,0002,477,0002,138,112
3Jun 27, 2026 01:403,47417,571,2776,215,0002,472,0002,138,112
4Jun 27, 2026 01:403,47817,755,1506,210,0002,486,0002,138,112
5Jun 27, 2026 01:403,48717,711,7206,250,0002,469,0002,138,112
6Jun 27, 2026 01:403,51417,798,8526,268,0002,518,0002,138,112
7Jun 27, 2026 01:403,51817,940,6245,219,0003,577,0002,138,112
8Jun 27, 2026 01:403,55017,907,9345,988,0002,888,0002,138,112
9Jun 27, 2026 01:403,56017,846,0095,982,0002,918,0002,129,920