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:00Victor 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:022,50913,813,3724,951,0001,323,0002,113,536
2Jun 1, 2026 11:022,51213,850,2524,957,0001,324,0002,113,536
3Jun 1, 2026 11:022,51213,829,3604,955,0001,326,0002,113,536
4Jun 1, 2026 11:022,53013,858,3194,978,0001,349,0002,113,536
5Jun 1, 2026 11:022,61614,049,3315,214,0001,327,0002,113,536
6Jun 1, 2026 11:022,61614,057,3345,216,0001,325,0002,113,536
7Jun 1, 2026 11:022,62214,093,1495,234,0001,323,0002,113,536
8Jun 1, 2026 11:022,64014,076,1165,251,0001,351,0002,113,536
9Jun 1, 2026 11:022,64314,126,2175,272,0001,336,0002,113,536