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:50Andrew EpsteinAndrew EpsteinScore: 8,790Success
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:508,71630,988,04020,721,0001,070,0002,117,632stderr
2Nov 2, 2026 21:508,72631,025,10920,736,0001,081,0002,117,632stderr
3Nov 2, 2026 21:508,72931,132,80020,732,0001,092,0002,117,632stderr
4Nov 2, 2026 21:508,72931,116,82320,740,0001,083,0002,117,632stderr
5Nov 2, 2026 21:508,79031,212,58320,797,0001,179,0002,117,632stderr
6Nov 2, 2026 21:508,82031,308,19020,949,0001,102,0002,117,632stderr
7Nov 2, 2026 21:508,84631,339,94721,007,0001,110,0002,117,632stderr
8Nov 2, 2026 21:508,88531,931,76321,100,0001,113,0002,117,632stderr
9Nov 2, 2026 21:5010,43735,838,96524,921,0001,172,0002,117,632stderr