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 listAug 2, 2026 17:53Victor MerckléVictor MerckléScore: 1,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:551,65812,525,4302,990,0001,156,0002,117,632stderr
2Aug 2, 2026 17:551,66212,558,6382,990,0001,166,0002,117,632stderr
3Aug 2, 2026 17:551,69213,335,3013,088,0001,142,0002,117,632stderr
4Aug 2, 2026 17:551,69213,274,2653,076,0001,154,0002,117,632stderr
5Aug 2, 2026 17:551,69413,023,8943,084,0001,152,0002,117,632stderr
6Aug 2, 2026 17:551,70113,394,5423,090,0001,164,0002,117,632stderr
7Aug 2, 2026 17:551,70213,389,2093,100,0001,156,0002,117,632stderr
8Aug 2, 2026 17:551,70312,670,2033,115,0001,143,0002,117,632stderr
9Aug 2, 2026 17:551,71313,307,6863,116,0001,168,0002,117,632stderr