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 13, 2026 23:09Victor MerckléVictor MerckléScore: 6,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 23:105,76223,517,47811,203,0003,203,0002,117,632
2Jun 13, 2026 23:105,81723,686,81311,295,0003,249,0002,117,632
3Jun 13, 2026 23:106,06524,311,67411,953,0003,211,0002,117,632
4Jun 13, 2026 23:106,11924,377,56112,107,0003,192,0002,117,632
5Jun 13, 2026 23:106,14424,607,74712,122,0003,238,0002,117,632
6Jun 13, 2026 23:106,19424,637,99312,266,0003,221,0002,117,632
7Jun 13, 2026 23:106,31124,901,87712,584,0003,195,0002,117,632
8Jun 13, 2026 23:106,32424,905,10712,591,0003,221,0002,117,632
9Jun 13, 2026 23:106,34925,043,01112,636,0003,238,0002,117,632