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 11:25Victor MerckléVictor MerckléScore: 2,616Success
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 11:272,51813,861,1514,967,0001,329,0002,113,536
2Jun 1, 2026 11:272,52713,971,3694,987,0001,331,0002,113,536
3Jun 1, 2026 11:272,54013,898,3035,023,0001,329,0002,113,536
4Jun 1, 2026 11:272,58613,996,3205,132,0001,334,0002,113,536
5Jun 1, 2026 11:272,61614,042,0605,219,0001,322,0002,113,536
6Jun 1, 2026 11:272,61714,023,2695,220,0001,323,0002,113,536
7Jun 1, 2026 11:272,62014,095,2745,228,0001,324,0002,113,536
8Jun 1, 2026 11:272,62114,018,5015,228,0001,325,0002,113,536
9Jun 1, 2026 11:272,66814,202,8825,312,0001,358,0002,113,536