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 03:40Victor MerckléVictor MerckléScore: 2,934Success
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 03:412,77916,006,3784,393,0002,556,0002,142,208
2Jun 27, 2026 03:412,80016,070,0564,679,0002,322,0002,142,208
3Jun 27, 2026 03:412,82316,320,6434,454,0002,605,0002,142,208
4Jun 27, 2026 03:412,83416,713,8664,733,0002,353,0002,142,208
5Jun 27, 2026 03:412,93417,143,7804,695,0002,642,0002,142,208
6Jun 27, 2026 03:412,98116,924,8185,078,0002,375,0002,142,208
7Jun 27, 2026 03:413,02017,310,4184,894,0002,658,0002,142,208
8Jun 27, 2026 03:413,02616,509,4004,891,0002,674,0002,142,208
9Jun 27, 2026 03:413,03217,217,2475,175,0002,405,0002,138,112