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 listJul 7, 2026 21:05Victor MerckléVictor MerckléScore: 1,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 21:081,58612,045,2392,880,0001,086,0002,117,632stderr
2Jul 7, 2026 21:081,61612,109,3552,910,0001,130,0002,117,632stderr
3Jul 7, 2026 21:081,63412,197,3082,885,0001,201,0002,117,632stderr
4Jul 7, 2026 21:081,67112,208,3783,056,0001,123,0002,117,632stderr
5Jul 7, 2026 21:081,67812,246,8963,045,0001,152,0002,117,632stderr
6Jul 7, 2026 21:081,70112,892,1173,112,0001,141,0002,117,632stderr
7Jul 7, 2026 21:081,70912,879,7313,126,0001,148,0002,117,632stderr
8Jul 7, 2026 21:081,72612,964,9213,158,0001,158,0002,117,632stderr
9Jul 7, 2026 21:081,73212,424,5023,154,0001,176,0002,117,632stderr