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:43Andrew EpsteinAndrew EpsteinScore: 8,091Success
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:477,97629,123,62218,864,0001,076,0002,117,632stderr
2Nov 2, 2026 23:478,01329,329,90618,960,0001,074,0002,117,632stderr
3Nov 2, 2026 23:478,03129,250,10418,883,0001,196,0002,117,632stderr
4Nov 2, 2026 23:478,06629,386,76819,085,0001,081,0002,117,632stderr
5Nov 2, 2026 23:478,09129,394,18919,134,0001,094,0002,117,632stderr
6Nov 2, 2026 23:478,09329,488,52119,144,0001,090,0002,117,632stderr
7Nov 2, 2026 23:478,14229,570,14719,211,0001,144,0002,117,632stderr
8Nov 2, 2026 23:478,15629,543,21519,234,0001,157,0002,117,632stderr
9Nov 2, 2026 23:478,15729,620,52219,236,0001,157,0002,117,632stderr