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 10, 2026 23:56Victor MerckléVictor MerckléScore: 3,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 23:572,84416,241,5564,474,0002,637,0002,142,208
2Jun 10, 2026 23:572,87316,009,6804,795,0002,388,0002,142,208
3Jun 10, 2026 23:572,90916,205,2324,638,0002,636,0002,142,208
4Jun 10, 2026 23:573,02817,036,5045,106,0002,466,0002,142,208
5Jun 10, 2026 23:573,04215,925,4065,008,0002,597,0002,142,208
6Jun 10, 2026 23:573,04715,658,8335,282,0002,336,0002,142,208
7Jun 10, 2026 23:573,14717,295,1405,490,0002,379,0002,142,208
8Jun 10, 2026 23:573,14917,118,4695,315,0002,559,0002,142,208
9Jun 10, 2026 23:573,18515,669,0125,406,0002,557,0002,142,208