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 listJul 8, 2026 00:03Victor MerckléVictor MerckléScore: 1,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 00:031,60312,083,2222,903,0001,106,0002,117,632stderr
2Jul 8, 2026 00:031,60712,101,8052,904,0001,114,0002,117,632stderr
3Jul 8, 2026 00:031,61212,016,3232,912,0001,119,0002,117,632stderr
4Jul 8, 2026 00:031,65912,163,5663,012,0001,137,0002,117,632stderr
5Jul 8, 2026 00:031,66012,036,4273,016,0001,135,0002,117,632stderr
6Jul 8, 2026 00:031,70212,312,7673,118,0001,139,0002,117,632stderr
7Jul 8, 2026 00:031,71212,367,3543,129,0001,152,0002,117,632stderr
8Jul 8, 2026 00:031,72312,864,9843,165,0001,144,0002,117,632stderr
9Jul 8, 2026 00:031,74012,888,0483,200,0001,150,0002,117,632stderr