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 16:39Victor MerckléVictor MerckléScore: 2,694Success
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 16:412,58214,328,7025,143,0001,313,0002,113,536
2May 29, 2026 16:412,59116,146,6895,163,0001,316,0002,113,536
3May 29, 2026 16:412,64016,045,1055,255,0001,345,0002,113,536
4May 29, 2026 16:412,68815,386,7195,417,0001,304,0002,113,536
5May 29, 2026 16:412,69414,379,6295,426,0001,310,0002,113,536
6May 29, 2026 16:412,70314,509,5885,448,0001,311,0002,113,536
7May 29, 2026 16:412,71915,367,3755,488,0001,311,0002,113,536
8May 29, 2026 16:412,75416,941,1305,566,0001,321,0002,113,536
9May 29, 2026 16:412,76915,037,9755,586,0001,338,0002,113,536