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 22:13Andrew EpsteinAndrew EpsteinScore: 1,177Success
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 22:151,17313,496,3422,933,00002,117,632
2Nov 2, 2026 22:151,17312,134,8702,934,00002,117,632
3Nov 2, 2026 22:151,17612,145,3372,940,00002,117,632
4Nov 2, 2026 22:151,17612,135,0502,941,00002,117,632
5Nov 2, 2026 22:151,17712,150,9262,944,00002,117,632
6Nov 2, 2026 22:151,17912,147,9852,948,00002,117,632
7Nov 2, 2026 22:151,23412,289,6363,085,00002,117,632
8Nov 2, 2026 22:151,24512,240,6323,114,00002,117,632
9Nov 2, 2026 22:151,25412,365,3263,136,00002,117,632