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 30, 2026 22:46Victor MerckléVictor MerckléScore: 1,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:481,65612,095,9722,939,0001,201,0002,117,632stderr
2Jun 30, 2026 22:481,66012,047,3662,948,0001,202,0002,117,632stderr
3Jun 30, 2026 22:481,66412,030,5132,951,0001,211,0002,117,632stderr
4Jun 30, 2026 22:481,66812,079,3712,963,0001,209,0002,117,632stderr
5Jun 30, 2026 22:481,66812,026,9792,956,0001,214,0002,117,632stderr
6Jun 30, 2026 22:481,67112,117,7832,957,0001,222,0002,117,632stderr
7Jun 30, 2026 22:481,69312,184,0753,008,0001,225,0002,117,632stderr
8Jun 30, 2026 22:481,75412,298,9893,124,0001,263,0002,117,632stderr
9Jun 30, 2026 22:481,76212,746,3313,169,0001,237,0002,117,632stderr