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 00:06Victor MerckléVictor MerckléScore: 6,002Success
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 00:075,75623,492,59611,199,0003,192,0002,117,632
2Jun 14, 2026 00:075,75823,563,97111,181,0003,214,0002,117,632
3Jun 14, 2026 00:075,79223,666,28611,285,0003,195,0002,117,632
4Jun 14, 2026 00:075,79523,642,66511,262,0003,226,0002,117,632
5Jun 14, 2026 00:076,00224,220,66311,797,0003,208,0002,117,632
6Jun 14, 2026 00:076,07124,310,08111,920,0003,259,0002,117,632
7Jun 14, 2026 00:076,07824,334,70511,943,0003,253,0002,117,632
8Jun 14, 2026 00:076,08024,435,54612,018,0003,184,0002,117,632
9Jun 14, 2026 00:076,14824,470,80312,156,0003,214,0002,117,632