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 15, 2026 12:51Victor MerckléVictor MerckléScore: 2,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 13:052,10212,835,1552,742,0002,513,0002,117,632
2Jun 15, 2026 13:052,17613,041,2213,128,0002,314,0002,117,632
3Jun 15, 2026 13:052,22113,031,3293,044,0002,510,0002,117,632
4Jun 15, 2026 13:052,23712,990,4953,273,0002,321,0002,117,632
5Jun 15, 2026 13:052,26413,213,2273,331,0002,331,0002,117,632
6Jun 15, 2026 13:052,27413,275,6373,325,0002,361,0002,117,632
7Jun 15, 2026 13:052,31313,355,7583,292,0002,492,0002,117,632
8Jun 15, 2026 13:052,32013,318,3183,300,0002,500,0002,117,632
9Jun 15, 2026 13:052,32513,276,0293,303,0002,511,0002,117,632