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:34Andrew EpsteinAndrew EpsteinScore: 12,700Success
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:3512,59043,426,55730,346,0001,130,0002,121,728stderr
2Nov 2, 2026 21:3512,64340,845,76430,477,0001,132,0002,117,632stderr
3Nov 2, 2026 21:3512,67840,892,36230,569,0001,127,0002,117,632stderr
4Nov 2, 2026 21:3512,69240,940,60830,593,0001,139,0002,117,632stderr
5Nov 2, 2026 21:3512,70041,373,46530,610,0001,141,0002,117,632stderr
6Nov 2, 2026 21:3512,71841,032,56130,661,0001,136,0002,117,632stderr
7Nov 2, 2026 21:3512,75241,125,73530,745,0001,135,0002,117,632stderr
8Nov 2, 2026 21:3512,76041,552,98830,701,0001,201,0002,117,632stderr
9Nov 2, 2026 21:3512,79741,187,69530,769,0001,224,0002,117,632stderr