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 13, 2026 20:35Victor MerckléVictor MerckléScore: 18,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 20:3618,10354,446,06642,172,0003,087,0002,117,632
2Jun 13, 2026 20:3618,13254,463,85742,242,0003,088,0002,117,632
3Jun 13, 2026 20:3618,64355,794,57942,567,0004,041,0002,117,632
4Jun 13, 2026 20:3618,66255,751,84942,592,0004,064,0002,117,632
5Jun 13, 2026 20:3618,72456,007,86142,775,0004,036,0002,117,632
6Jun 13, 2026 20:3618,85956,326,37143,083,0004,066,0002,117,632
7Jun 13, 2026 20:3619,15457,109,02844,799,0003,086,0002,117,632
8Jun 13, 2026 20:3619,26858,525,37044,041,0004,130,0002,117,632
9Jun 13, 2026 20:3619,73458,626,47345,248,0004,087,0002,117,632