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 15:25Victor MerckléVictor MerckléScore: 2,892Success
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 15:262,65517,156,9834,229,0002,409,0002,146,304stderr
2Jul 7, 2026 15:262,66616,997,6664,115,0002,552,0002,146,304stderr
3Jul 7, 2026 15:262,68517,437,7364,235,0002,478,0002,146,304stderr
4Jul 7, 2026 15:262,68617,261,9514,281,0002,435,0002,146,304stderr
5Jul 7, 2026 15:262,89217,465,9414,859,0002,373,0002,146,304stderr
6Jul 7, 2026 15:262,89517,429,0194,957,0002,281,0002,146,304stderr
7Jul 7, 2026 15:262,90617,505,8664,846,0002,419,0002,146,304stderr
8Jul 7, 2026 15:262,91517,388,5455,010,0002,279,0002,142,208stderr
9Jul 7, 2026 15:262,92517,386,9585,027,0002,287,0002,146,304stderr