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 2, 2026 08:11Victor MerckléVictor MerckléScore: 2,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 08:132,15616,599,3724,154,0001,236,0002,113,536
2Jun 2, 2026 08:132,16714,994,2144,172,0001,246,0002,113,536
3Jun 2, 2026 08:132,20813,199,6634,250,0001,272,0002,113,536
4Jun 2, 2026 08:132,23113,250,6124,265,0001,314,0002,113,536
5Jun 2, 2026 08:132,23513,028,7704,339,0001,249,0002,113,536
6Jun 2, 2026 08:132,23613,605,4554,345,0001,246,0002,113,536
7Jun 2, 2026 08:132,24914,533,0134,377,0001,247,0002,113,536
8Jun 2, 2026 08:132,25213,287,8044,384,0001,248,0002,113,536
9Jun 2, 2026 08:132,30813,345,6534,495,0001,275,0002,113,536