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 04:01Victor MerckléVictor MerckléScore: 2,635Success
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 04:022,52115,562,4293,795,0002,509,0002,142,208
2Jun 27, 2026 04:022,54215,541,8903,829,0002,528,0002,142,208
3Jun 27, 2026 04:022,55016,023,4663,849,0002,528,0002,142,208
4Jun 27, 2026 04:022,59415,843,3003,902,0002,584,0002,142,208
5Jun 27, 2026 04:022,63516,072,2894,168,0002,421,0002,142,208
6Jun 27, 2026 04:022,63816,411,0294,178,0002,419,0002,142,208
7Jun 27, 2026 04:022,63916,080,7944,019,0002,580,0002,142,208
8Jun 27, 2026 04:022,70116,649,9964,199,0002,554,0002,142,208
9Jun 27, 2026 04:022,70416,465,1584,547,0002,213,0002,142,208