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 2, 2026 03:58Victor MerckléVictor MerckléScore: 2,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 04:002,23813,390,8374,359,0001,236,0002,113,536
2Jun 2, 2026 04:002,28813,360,1474,486,0001,236,0002,113,536
3Jun 2, 2026 04:002,29813,757,7324,513,0001,233,0002,113,536
4Jun 2, 2026 04:002,30113,331,5964,518,0001,235,0002,113,536
5Jun 2, 2026 04:002,31213,698,5424,542,0001,238,0002,113,536
6Jun 2, 2026 04:002,31413,401,1474,543,0001,242,0002,113,536
7Jun 2, 2026 04:002,33013,477,4844,573,0001,252,0002,113,536
8Jun 2, 2026 04:002,33115,044,6234,578,0001,250,0002,113,536
9Jun 2, 2026 04:002,35915,541,2964,632,0001,266,0002,113,536