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 00:52Victor MerckléVictor MerckléScore: 2,796Success
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 00:532,57616,700,4003,610,0002,830,0002,142,208
2Jun 30, 2026 00:532,62414,354,8293,534,0003,027,0002,142,208
3Jun 30, 2026 00:532,63918,382,7763,532,0003,066,0002,142,208
4Jun 30, 2026 00:532,71816,776,5783,815,0002,981,0002,142,208
5Jun 30, 2026 00:532,79616,752,2133,823,0003,167,0002,142,208
6Jun 30, 2026 00:532,80317,150,4373,889,0003,120,0002,142,208
7Jun 30, 2026 00:532,81217,151,4983,937,0003,093,0002,142,208
8Jun 30, 2026 00:532,82817,203,2263,961,0003,110,0002,142,208
9Jun 30, 2026 00:532,85517,417,1874,018,0003,120,0002,142,208