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 14, 2026 03:35Victor MerckléVictor MerckléScore: 5,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 03:355,33922,470,88810,252,0003,097,0002,117,632
2Jun 14, 2026 03:355,36322,568,97510,293,0003,116,0002,117,632
3Jun 14, 2026 03:355,37222,720,46510,324,0003,108,0002,117,632
4Jun 14, 2026 03:355,40322,752,31810,329,0003,179,0002,117,632
5Jun 14, 2026 03:355,40922,752,68410,417,0003,107,0002,117,632
6Jun 14, 2026 03:355,60623,172,95510,890,0003,126,0002,117,632
7Jun 14, 2026 03:355,68423,358,36311,071,0003,140,0002,117,632
8Jun 14, 2026 03:355,86623,862,22811,512,0003,153,0002,117,632
9Jun 14, 2026 03:355,91023,956,35711,623,0003,154,0002,117,632