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 14:47Victor MerckléVictor MerckléScore: 2,522Success
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 14:482,51413,901,2594,961,0001,325,0002,113,536
2Jun 1, 2026 14:482,51613,826,3904,961,0001,329,0002,113,536
3Jun 1, 2026 14:482,51613,880,9094,962,0001,328,0002,113,536
4Jun 1, 2026 14:482,51913,855,6014,972,0001,327,0002,113,536
5Jun 1, 2026 14:482,52213,893,9144,965,0001,341,0002,113,536
6Jun 1, 2026 14:482,52813,957,6864,991,0001,330,0002,113,536
7Jun 1, 2026 14:482,52913,857,7774,992,0001,331,0002,113,536
8Jun 1, 2026 14:482,52913,891,0334,994,0001,329,0002,113,536
9Jun 1, 2026 14:482,61014,034,3295,199,0001,327,0002,113,536