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 4, 2026 10:44Victor MerckléVictor MerckléScore: 118,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 10:45117,973310,111,253291,924,0003,010,0002,482,176stderr
2May 4, 2026 10:45118,030309,645,023292,031,0003,045,0002,490,368stderr
3May 4, 2026 10:45118,054314,891,634292,129,0003,007,0002,469,888stderr
4May 4, 2026 10:45118,821313,512,395294,011,0003,043,0002,494,464stderr
5May 4, 2026 10:45118,848313,273,565294,076,0003,044,0002,478,080stderr
6May 4, 2026 10:45118,856316,467,135293,122,0004,020,0002,478,080stderr
7May 4, 2026 10:45118,877314,399,820294,100,0003,093,0002,490,368stderr
8May 4, 2026 10:45119,022314,653,169294,528,0003,027,0002,490,368stderr
9May 4, 2026 10:45119,342317,163,286295,257,0003,100,0002,494,464stderr