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 22:43Victor MerckléVictor MerckléScore: 6,298Success
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 22:446,06824,357,49011,968,0003,203,0002,117,632
2Jun 13, 2026 22:446,13724,423,35812,120,0003,223,0002,117,632
3Jun 13, 2026 22:446,20024,614,11312,291,0003,211,0002,117,632
4Jun 13, 2026 22:446,22324,727,16412,336,0003,223,0002,117,632
5Jun 13, 2026 22:446,29824,873,77312,549,0003,198,0002,117,632
6Jun 13, 2026 22:446,31425,029,85912,586,0003,200,0002,117,632
7Jun 13, 2026 22:446,33124,980,33412,570,0003,259,0002,117,632
8Jun 13, 2026 22:446,40225,208,51012,797,0003,210,0002,117,632
9Jun 13, 2026 22:446,41925,358,86512,829,0003,219,0002,117,632