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 17:00Victor MerckléVictor MerckléScore: 2,611Success
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 17:022,52313,854,6684,976,0001,333,0002,113,536
2Jun 1, 2026 17:022,59013,992,3495,152,0001,323,0002,113,536
3Jun 1, 2026 17:022,60413,999,9355,182,0001,329,0002,113,536
4Jun 1, 2026 17:022,60614,026,3975,189,0001,327,0002,113,536
5Jun 1, 2026 17:022,61113,986,5175,192,0001,336,0002,113,536
6Jun 1, 2026 17:022,61414,133,9195,204,0001,332,0002,113,536
7Jun 1, 2026 17:022,61814,038,3515,214,0001,331,0002,113,536
8Jun 1, 2026 17:022,62814,014,0345,235,0001,335,0002,113,536
9Jun 1, 2026 17:022,70814,324,7424,416,0002,356,0002,113,536