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 2, 2026 04:19Victor MerckléVictor MerckléScore: 2,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 04:212,19113,104,6654,242,0001,236,0002,113,536
2Jun 2, 2026 04:212,26314,872,4704,413,0001,245,0002,113,536
3Jun 2, 2026 04:212,27313,280,5224,441,0001,243,0002,113,536
4Jun 2, 2026 04:212,27313,288,3254,440,0001,243,0002,113,536
5Jun 2, 2026 04:212,27313,731,3774,439,0001,244,0002,113,536
6Jun 2, 2026 04:212,27413,312,1824,449,0001,236,0002,113,536
7Jun 2, 2026 04:212,28413,361,2244,460,0001,251,0002,113,536
8Jun 2, 2026 04:212,31913,419,7284,523,0001,275,0002,113,536
9Jun 2, 2026 04:212,32213,810,4904,535,0001,272,0002,113,536