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,182Success
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,09269,422,43059,097,0001,134,0002,117,632stderr
2Nov 2, 2026 21:2324,10269,533,01659,085,0001,171,0002,117,632stderr
3Nov 2, 2026 21:2324,14269,811,81159,231,0001,124,0002,117,632stderr
4Nov 2, 2026 21:2324,16269,600,29759,270,0001,137,0002,117,632stderr
5Nov 2, 2026 21:2324,18269,661,15559,312,0001,144,0002,117,632stderr
6Nov 2, 2026 21:2324,22870,261,43759,415,0001,155,0002,117,632stderr
7Nov 2, 2026 21:2324,27870,377,80759,534,0001,161,0002,117,632stderr
8Nov 2, 2026 21:2324,39870,668,72559,774,0001,222,0002,117,632stderr
9Nov 2, 2026 21:2326,71876,442,15065,570,0001,226,0002,117,632stderr