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 10:41Victor MerckléVictor MerckléScore: 2,590Success
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 10:422,50513,817,3134,939,0001,324,0002,113,536
2Jun 1, 2026 10:422,51413,842,6394,961,0001,325,0002,113,536
3Jun 1, 2026 10:422,52213,881,4994,977,0001,330,0002,113,536
4Jun 1, 2026 10:422,55313,908,7305,035,0001,349,0002,113,536
5Jun 1, 2026 10:422,59013,983,8195,157,0001,320,0002,113,536
6Jun 1, 2026 10:422,60013,879,1055,178,0001,322,0002,113,536
7Jun 1, 2026 10:422,60414,064,0775,187,0001,323,0002,113,536
8Jun 1, 2026 10:422,61814,296,8635,224,0001,321,0002,113,536
9Jun 1, 2026 10:422,68014,250,5134,424,0002,277,0002,113,536