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 10, 2026 09:19Victor MerckléVictor MerckléScore: 3,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 09:213,07317,226,7965,168,0002,516,0002,142,208
2Jun 10, 2026 09:213,15115,519,2675,281,0002,598,0002,142,208
3Jun 10, 2026 09:213,19918,114,2795,319,0002,679,0002,142,208
4Jun 10, 2026 09:213,24016,774,7385,848,0002,252,0002,142,208
5Jun 10, 2026 09:213,25417,880,8335,433,0002,702,0002,142,208
6Jun 10, 2026 09:213,27317,641,0235,483,0002,700,0002,142,208
7Jun 10, 2026 09:213,27317,984,0975,532,0002,652,0002,142,208
8Jun 10, 2026 09:213,33017,854,1106,002,0002,323,0002,142,208
9Jun 10, 2026 09:213,37018,106,7656,079,0002,347,0002,142,208