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 listMay 30, 2026 00:20Victor MerckléVictor MerckléScore: 2,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 00:222,54916,392,4895,042,0001,332,0002,113,536
2May 30, 2026 00:222,56514,234,7175,078,0001,336,0002,113,536
3May 30, 2026 00:222,58315,464,8835,107,0001,351,0002,113,536
4May 30, 2026 00:222,62815,596,4525,248,0001,323,0002,113,536
5May 30, 2026 00:222,62915,049,2455,247,0001,326,0002,113,536
6May 30, 2026 00:222,63214,893,9015,257,0001,325,0002,113,536
7May 30, 2026 00:222,63616,032,6375,268,0001,322,0002,113,536
8May 30, 2026 00:222,65214,420,7715,285,0001,345,0002,113,536
9May 30, 2026 00:222,66616,021,8925,327,0001,339,0002,113,536