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 23:57Victor MerckléVictor MerckléScore: 2,342Success
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 23:592,24713,273,1324,385,0001,233,0002,113,536
2Jun 1, 2026 23:592,25813,282,3304,409,0001,237,0002,113,536
3Jun 1, 2026 23:592,26513,294,4424,426,0001,238,0002,113,536
4Jun 1, 2026 23:592,29713,387,2734,484,0001,260,0002,113,536
5Jun 1, 2026 23:592,34213,487,4164,620,0001,237,0002,113,536
6Jun 1, 2026 23:592,36713,595,7304,688,0001,231,0002,113,536
7Jun 1, 2026 23:592,37513,941,5414,692,0001,246,0002,113,536
8Jun 1, 2026 23:592,37814,668,5254,708,0001,237,0002,113,536
9Jun 1, 2026 23:592,38013,649,7104,715,0001,236,0002,113,536