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:01Victor MerckléVictor MerckléScore: 5,782Success
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:025,74123,482,80811,159,0003,194,0002,117,632
2Jun 14, 2026 02:025,74423,504,45811,159,0003,203,0002,117,632
3Jun 14, 2026 02:025,74523,481,61511,189,0003,174,0002,117,632
4Jun 14, 2026 02:025,76623,555,65511,214,0003,201,0002,117,632
5Jun 14, 2026 02:025,78223,630,68111,220,0003,235,0002,117,632
6Jun 14, 2026 02:025,79523,668,49811,294,0003,194,0002,117,632
7Jun 14, 2026 02:025,80823,746,01611,306,0003,214,0002,117,632
8Jun 14, 2026 02:025,80923,633,67211,320,0003,203,0002,117,632
9Jun 14, 2026 02:026,04224,255,64911,894,0003,212,0002,117,632