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:22Andrew EpsteinAndrew EpsteinScore: 24,501Success
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:2324,43670,715,53959,934,0001,156,0002,117,632stderr
2Nov 2, 2026 21:2324,44370,698,51859,965,0001,144,0002,117,632stderr
3Nov 2, 2026 21:2324,45270,735,79459,972,0001,158,0002,117,632stderr
4Nov 2, 2026 21:2324,47470,771,06859,975,0001,211,0002,117,632stderr
5Nov 2, 2026 21:2324,50170,963,25260,099,0001,154,0002,117,632stderr
6Nov 2, 2026 21:2324,51370,822,44560,117,0001,167,0002,117,632stderr
7Nov 2, 2026 21:2324,51370,878,37460,121,0001,162,0002,117,632stderr
8Nov 2, 2026 21:2324,56571,103,01660,245,0001,168,0002,117,632stderr
9Nov 2, 2026 21:2324,73081,257,56260,814,0001,013,0002,117,632stderr