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:44Andrew EpsteinAndrew EpsteinScore: 9,158Success
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:448,98631,590,72821,377,0001,088,0002,117,632stderr
2Nov 2, 2026 21:449,12032,386,76621,684,0001,116,0002,117,632stderr
3Nov 2, 2026 21:449,14932,472,34121,758,0001,115,0002,117,632stderr
4Nov 2, 2026 21:449,15532,468,35721,766,0001,122,0002,117,632stderr
5Nov 2, 2026 21:449,15832,482,99121,786,0001,111,0002,117,632stderr
6Nov 2, 2026 21:449,16131,970,70621,734,0001,169,0002,117,632stderr
7Nov 2, 2026 21:449,16132,520,46021,783,0001,120,0002,117,632stderr
8Nov 2, 2026 21:449,17032,462,49321,743,0001,182,0002,117,632stderr
9Nov 2, 2026 21:449,69433,831,88423,078,0001,159,0002,117,632stderr