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:26Andrew EpsteinAndrew EpsteinScore: 1,304Success
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:301,17813,732,1762,946,00002,117,632
2Nov 2, 2026 23:301,30212,427,6481,886,0001,370,0002,117,632
3Nov 2, 2026 23:301,30212,415,9342,241,0001,016,0002,117,632
4Nov 2, 2026 23:301,30312,884,4142,245,0001,013,0002,117,632
5Nov 2, 2026 23:301,30412,645,5322,245,0001,016,0002,117,632
6Nov 2, 2026 23:301,30612,919,0042,232,0001,033,0002,117,632
7Nov 2, 2026 23:301,31012,848,9881,910,0001,366,0002,117,632
8Nov 2, 2026 23:301,31612,906,7452,267,0001,023,0002,117,632
9Nov 2, 2026 23:301,86213,827,4203,617,0001,040,0002,117,632