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 13:46Victor MerckléVictor MerckléScore: 19,820Success
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 13:4719,42255,979,08945,490,0003,065,0002,113,536
2Jun 13, 2026 13:4719,49556,239,02945,599,0003,139,0002,113,536
3Jun 13, 2026 13:4719,55057,436,15045,795,0003,080,0002,113,536
4Jun 13, 2026 13:4719,82056,877,87946,518,0003,034,0002,113,536
5Jun 13, 2026 13:4719,82056,886,39646,489,0003,063,0002,113,536
6Jun 13, 2026 13:4719,85957,039,54447,590,0002,058,0002,113,536
7Jun 13, 2026 13:4719,87457,103,02746,653,0003,032,0002,113,536
8Jun 13, 2026 13:4719,88257,148,71346,592,0003,114,0002,113,536
9Jun 13, 2026 13:4719,94157,321,07546,636,0003,218,0002,113,536