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:43Andrew EpsteinAndrew EpsteinScore: 1,252Success
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 23:491,16412,160,4032,910,00002,117,632
2Nov 2, 2026 23:491,23612,314,9753,090,00002,117,632
3Nov 2, 2026 23:491,24512,409,2863,113,00002,117,632
4Nov 2, 2026 23:491,25112,288,9193,129,00002,117,632
5Nov 2, 2026 23:491,25212,404,6273,130,00002,117,632
6Nov 2, 2026 23:491,25912,367,5543,148,00002,117,632
7Nov 2, 2026 23:491,28812,438,9081,814,0001,408,0002,117,632
8Nov 2, 2026 23:491,28812,470,6992,207,0001,013,0002,117,632
9Nov 2, 2026 23:491,29512,494,3112,211,0001,027,0002,117,632