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 listNov 2, 2026 21:41Andrew EpsteinAndrew EpsteinScore: 16,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2026 21:4116,22849,874,62939,464,0001,106,0002,117,632stderr
2Nov 2, 2026 21:4116,31649,986,99639,676,0001,115,0002,117,632stderr
3Nov 2, 2026 21:4116,34250,036,64539,738,0001,118,0002,117,632stderr
4Nov 2, 2026 21:4116,37750,148,02639,812,0001,131,0002,117,632stderr
5Nov 2, 2026 21:4116,39950,184,53239,875,0001,123,0002,117,632stderr
6Nov 2, 2026 21:4116,40350,275,42339,870,0001,138,0002,117,632stderr
7Nov 2, 2026 21:4116,40550,252,68539,870,0001,143,0002,117,632stderr
8Nov 2, 2026 21:4116,41850,249,03039,908,0001,137,0002,117,632stderr
9Nov 2, 2026 21:4116,60050,732,17440,300,0001,201,0002,117,632stderr