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 09:22Victor MerckléVictor MerckléScore: 2,808Success
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 09:242,75616,612,3104,510,0002,380,0002,113,536
2May 30, 2026 09:242,77615,490,9564,379,0002,562,0002,113,536
3May 30, 2026 09:242,80115,962,0784,586,0002,417,0002,113,536
4May 30, 2026 09:242,80518,390,5144,607,0002,407,0002,113,536
5May 30, 2026 09:242,80814,761,2054,619,0002,401,0002,113,536
6May 30, 2026 09:242,81915,674,9824,614,0002,434,0002,113,536
7May 30, 2026 09:242,82016,484,2364,634,0002,417,0002,113,536
8May 30, 2026 09:242,82715,717,4904,569,0002,500,0002,113,536
9May 30, 2026 09:242,82815,822,4094,621,0002,449,0002,113,536