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 23:51Andrew EpsteinAndrew EpsteinScore: 1,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 00:021,22322,780,5711,706,0001,353,0002,117,632
2Nov 3, 2026 00:021,24019,905,4721,743,0001,358,0002,117,632
3Nov 3, 2026 00:021,29712,382,9662,215,0001,029,0002,117,632
4Nov 3, 2026 00:021,30012,361,7531,948,0001,302,0002,117,632
5Nov 3, 2026 00:021,30012,588,4592,221,0001,029,0002,117,632
6Nov 3, 2026 00:021,30112,359,4972,212,0001,041,0002,117,632
7Nov 3, 2026 00:021,30512,359,9232,247,0001,016,0002,117,632
8Nov 3, 2026 00:021,30812,497,0661,876,0001,396,0002,117,632
9Nov 3, 2026 00:021,31212,302,0812,243,0001,039,0002,117,632