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:23Victor MerckléVictor MerckléScore: 6,330Success
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:245,74923,574,80411,172,0003,202,0002,117,632
2Jun 14, 2026 01:245,81523,710,22711,308,0003,231,0002,117,632
3Jun 14, 2026 01:246,12424,501,39812,084,0003,226,0002,117,632
4Jun 14, 2026 01:246,16224,581,20212,168,0003,237,0002,117,632
5Jun 14, 2026 01:246,33025,052,69512,612,0003,215,0002,117,632
6Jun 14, 2026 01:246,38625,174,70712,781,0003,185,0002,117,632
7Jun 14, 2026 01:246,39426,269,06912,761,0003,225,0002,117,632
8Jun 14, 2026 01:246,39425,191,15312,729,0003,257,0002,117,632
9Jun 14, 2026 01:246,39925,555,26712,796,0003,203,0002,117,632