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 1, 2026 23:12Victor MerckléVictor MerckléScore: 2,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 23:142,47413,803,5264,979,0001,206,0002,113,536
2Jun 1, 2026 23:142,47413,876,0864,974,0001,213,0002,113,536
3Jun 1, 2026 23:142,47813,837,8334,984,0001,211,0002,113,536
4Jun 1, 2026 23:142,56314,341,5325,198,0001,210,0002,113,536
5Jun 1, 2026 23:142,56614,026,2385,201,0001,214,0002,113,536
6Jun 1, 2026 23:142,56813,849,8015,207,0001,214,0002,113,536
7Jun 1, 2026 23:142,57213,994,4675,221,0001,211,0002,113,536
8Jun 1, 2026 23:142,59114,125,2425,263,0001,216,0002,113,536
9Jun 1, 2026 23:142,60614,176,1965,278,0001,239,0002,113,536