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 listJun 13, 2026 22:15Victor MerckléVictor MerckléScore: 8,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 22:168,25729,788,03617,499,0003,144,0002,117,632
2Jun 13, 2026 22:168,49430,753,94518,094,0003,142,0002,117,632
3Jun 13, 2026 22:168,64230,776,37618,439,0003,166,0002,117,632
4Jun 13, 2026 22:168,65730,799,43218,514,0003,130,0002,117,632
5Jun 13, 2026 22:168,66430,865,55018,499,0003,163,0002,117,632
6Jun 13, 2026 22:168,75031,073,10018,780,0003,095,0002,117,632
7Jun 13, 2026 22:168,76931,044,07518,755,0003,169,0002,117,632
8Jun 13, 2026 22:168,77531,074,50018,809,0003,130,0002,117,632
9Jun 13, 2026 22:168,98331,598,84619,361,0003,097,0002,117,632