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 14, 2026 01:18Victor MerckléVictor MerckléScore: 6,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 01:195,69823,455,81011,010,0003,235,0002,117,632
2Jun 14, 2026 01:196,04924,714,59911,884,0003,240,0002,117,632
3Jun 14, 2026 01:196,06424,325,77811,951,0003,210,0002,117,632
4Jun 14, 2026 01:196,07824,311,09211,999,0003,197,0002,117,632
5Jun 14, 2026 01:196,12124,454,41812,101,0003,203,0002,117,632
6Jun 14, 2026 01:196,17924,622,07112,224,0003,224,0002,117,632
7Jun 14, 2026 01:196,19224,653,98112,279,0003,203,0002,117,632
8Jun 14, 2026 01:196,19724,779,36012,287,0003,206,0002,117,632
9Jun 14, 2026 01:196,20724,756,48912,302,0003,217,0002,117,632