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,926Success
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:518,86031,387,86621,063,0001,088,0002,117,632stderr
2Nov 2, 2026 21:518,88231,726,29121,112,0001,094,0002,117,632stderr
3Nov 2, 2026 21:518,88931,834,98221,111,0001,113,0002,117,632stderr
4Nov 2, 2026 21:518,89531,845,64221,129,0001,109,0002,117,632stderr
5Nov 2, 2026 21:518,92633,941,91921,193,0001,122,0002,117,632stderr
6Nov 2, 2026 21:518,93431,932,98421,166,0001,171,0002,117,632stderr
7Nov 2, 2026 21:518,93631,953,73821,167,0001,174,0002,117,632stderr
8Nov 2, 2026 21:518,96131,979,56021,227,0001,177,0002,117,632stderr
9Nov 2, 2026 21:519,27339,180,59721,930,0001,254,0002,117,632stderr