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 22:40Victor MerckléVictor MerckléScore: 3,578Success
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 22:443,45517,544,6645,369,0003,270,0002,183,168
2Jun 10, 2026 22:443,54917,840,5695,979,0002,894,0002,138,112
3Jun 10, 2026 22:443,56617,895,8236,011,0002,905,0002,138,112
4Jun 10, 2026 22:443,57217,926,0356,374,0002,557,0002,129,920
5Jun 10, 2026 22:443,57817,840,9486,419,0002,526,0002,138,112
6Jun 10, 2026 22:443,58117,880,3666,391,0002,562,0002,129,920
7Jun 10, 2026 22:443,58417,970,6765,241,0003,719,0002,187,264
8Jun 10, 2026 22:443,58718,043,8556,457,0002,512,0002,138,112
9Jun 10, 2026 22:443,64218,048,4116,219,0002,888,0002,138,112