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:13Andrew EpsteinAndrew EpsteinScore: 24,175Success
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:1424,05069,330,15158,993,0001,133,0002,117,632stderr
2Nov 2, 2026 21:1424,05169,405,91758,997,0001,132,0002,117,632stderr
3Nov 2, 2026 21:1424,05469,389,27758,998,0001,137,0002,117,632stderr
4Nov 2, 2026 21:1424,06269,341,54159,031,0001,126,0002,117,632stderr
5Nov 2, 2026 21:1424,17569,634,77459,288,0001,150,0002,117,632stderr
6Nov 2, 2026 21:1424,30469,958,62159,529,0001,233,0002,117,632stderr
7Nov 2, 2026 21:1424,81678,837,24561,024,0001,017,0002,117,632stderr
8Nov 2, 2026 21:1425,15472,176,41861,715,0001,171,0002,117,632stderr
9Nov 2, 2026 21:1431,49288,383,58377,567,0001,163,0002,117,632stderr