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 14, 2026 02:10Victor MerckléVictor MerckléScore: 5,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 02:115,44922,760,23510,482,0003,141,0002,117,632
2Jun 14, 2026 02:115,47122,838,01810,535,0003,143,0002,117,632
3Jun 14, 2026 02:115,62023,223,92310,864,0003,188,0002,117,632
4Jun 14, 2026 02:115,76823,591,00111,251,0003,169,0002,117,632
5Jun 14, 2026 02:115,78123,591,91311,316,0003,138,0002,117,632
6Jun 14, 2026 02:115,87223,839,85111,544,0003,137,0002,117,632
7Jun 14, 2026 02:115,88723,815,64411,584,0003,135,0002,117,632
8Jun 14, 2026 02:116,03024,524,47311,923,0003,153,0002,117,632
9Jun 14, 2026 02:116,03224,215,91611,930,0003,151,0002,117,632