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,444Success
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,25469,834,89759,492,0001,143,0002,117,632stderr
2Nov 2, 2026 21:1424,39170,501,18359,835,0001,144,0002,117,632stderr
3Nov 2, 2026 21:1424,39270,609,59259,836,0001,145,0002,117,632stderr
4Nov 2, 2026 21:1424,43470,698,49959,839,0001,246,0002,117,632stderr
5Nov 2, 2026 21:1424,44470,683,16859,895,0001,217,0002,117,632stderr
6Nov 2, 2026 21:1424,44470,391,46159,892,0001,219,0002,117,632stderr
7Nov 2, 2026 21:1424,45870,707,79159,986,0001,161,0002,117,632stderr
8Nov 2, 2026 21:1424,47870,815,56760,030,0001,165,0002,117,632stderr
9Nov 2, 2026 21:1424,57271,065,14160,263,0001,168,0002,117,632stderr