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:32Victor MerckléVictor MerckléScore: 5,964Success
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:335,89723,915,90411,575,0003,169,0002,117,632
2Jun 14, 2026 02:335,91124,177,11311,642,0003,136,0002,117,632
3Jun 14, 2026 02:335,94323,932,91511,688,0003,171,0002,117,632
4Jun 14, 2026 02:335,95524,091,29911,757,0003,131,0002,117,632
5Jun 14, 2026 02:335,96424,014,43211,767,0003,144,0002,117,632
6Jun 14, 2026 02:336,01024,181,36511,839,0003,186,0002,117,632
7Jun 14, 2026 02:336,04324,217,30511,989,0003,120,0002,117,632
8Jun 14, 2026 02:336,11124,432,78012,144,0003,134,0002,117,632
9Jun 14, 2026 02:336,12224,531,97712,154,0003,152,0002,117,632