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:21Victor MerckléVictor MerckléScore: 2,565Success
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:222,50513,828,7394,946,0001,318,0002,113,536
2Jun 1, 2026 10:222,52113,893,7204,978,0001,325,0002,113,536
3Jun 1, 2026 10:222,53013,824,8354,999,0001,326,0002,113,536
4Jun 1, 2026 10:222,53213,903,6514,984,0001,347,0002,113,536
5Jun 1, 2026 10:222,56514,026,2425,091,0001,323,0002,113,536
6Jun 1, 2026 10:222,60813,989,1665,199,0001,323,0002,113,536
7Jun 1, 2026 10:222,62214,114,7085,232,0001,323,0002,113,536
8Jun 1, 2026 10:222,62614,111,4745,237,0001,328,0002,113,536
9Jun 1, 2026 10:222,63014,077,5925,248,0001,327,0002,113,536