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 listMar 19, 2026 00:28Dominique GarmierDominique GarmierScore: 14,360Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 00:2814,34361,525,69629,882,0005,976,0002,375,680
2Mar 19, 2026 00:2814,35464,364,21830,902,0004,984,0002,514,944
3Mar 19, 2026 00:2814,35861,988,79030,910,0004,985,0002,424,832
4Mar 19, 2026 00:2814,35964,540,45233,904,0001,994,0002,428,928
5Mar 19, 2026 00:2814,36060,478,83630,915,0004,986,0002,433,024
6Mar 19, 2026 00:2814,36360,240,42827,928,0007,979,0002,437,120
7Mar 19, 2026 00:2814,36864,941,27128,936,0006,984,0002,269,184
8Mar 19, 2026 00:2814,38460,864,64632,963,0002,996,0002,441,216
9Mar 19, 2026 00:2814,38862,108,46332,972,0002,997,0002,289,664