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:36Victor MerckléVictor MerckléScore: 2,539Success
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:382,52816,636,9704,987,0001,334,0002,113,536
2May 30, 2026 00:382,53014,188,0444,992,0001,334,0002,113,536
3May 30, 2026 00:382,53416,814,6905,003,0001,334,0002,113,536
4May 30, 2026 00:382,53714,617,0465,007,0001,336,0002,113,536
5May 30, 2026 00:382,53914,899,7425,015,0001,333,0002,113,536
6May 30, 2026 00:382,54515,946,7865,022,0001,342,0002,113,536
7May 30, 2026 00:382,58015,591,4445,097,0001,354,0002,113,536
8May 30, 2026 00:382,61514,881,4175,208,0001,331,0002,113,536
9May 30, 2026 00:382,64816,331,2665,257,0001,364,0002,113,536