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 listMay 29, 2026 16:14Victor MerckléVictor MerckléScore: 2,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 16:162,59314,347,4675,158,0001,326,0002,113,536
2May 29, 2026 16:162,65215,084,3124,370,0002,262,0002,113,536
3May 29, 2026 16:162,70214,879,4605,442,0001,313,0002,113,536
4May 29, 2026 16:162,70215,512,5185,437,0001,318,0002,113,536
5May 29, 2026 16:162,71314,539,7155,464,0001,319,0002,113,536
6May 29, 2026 16:162,71516,047,5175,468,0001,321,0002,113,536
7May 29, 2026 16:162,72016,191,5685,481,0001,321,0002,113,536
8May 29, 2026 16:162,73216,398,9165,494,0001,336,0002,113,536
9May 29, 2026 16:162,74515,030,6215,527,0001,337,0002,113,536