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 29, 2026 21:21Victor MerckléVictor MerckléScore: 2,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 21:222,53914,719,0095,022,0001,327,0002,113,536
2May 29, 2026 21:222,54014,164,7025,022,0001,329,0002,113,536
3May 29, 2026 21:222,54815,253,8005,044,0001,328,0002,113,536
4May 29, 2026 21:222,55415,881,5405,054,0001,331,0002,113,536
5May 29, 2026 21:222,57215,449,9575,084,0001,347,0002,113,536
6May 29, 2026 21:222,62216,945,5484,278,0002,277,0002,113,536
7May 29, 2026 21:222,63215,230,1685,253,0001,327,0002,113,536
8May 29, 2026 21:222,64514,425,1795,287,0001,326,0002,113,536
9May 29, 2026 21:222,67016,991,3705,329,0001,348,0002,113,536