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 10, 2026 23:45Victor MerckléVictor MerckléScore: 2,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 23:472,83014,594,9704,377,0002,700,0002,142,208
2Jun 10, 2026 23:472,83416,320,3264,493,0002,593,0002,142,208
3Jun 10, 2026 23:472,85214,637,6964,547,0002,585,0002,142,208
4Jun 10, 2026 23:472,86416,878,8444,507,0002,654,0002,142,208
5Jun 10, 2026 23:472,94916,498,0143,921,0003,452,0002,142,208
6Jun 10, 2026 23:473,01417,023,7125,131,0002,405,0002,138,112
7Jun 10, 2026 23:473,09216,899,7555,014,0002,716,0002,142,208
8Jun 10, 2026 23:473,13217,491,9965,423,0002,408,0002,142,208
9Jun 10, 2026 23:473,16417,014,2025,518,0002,393,0002,142,208