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 listSep 26, 2026 18:13Kevin HeaveyKevin HeaveyScore: 1,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 18:141,15111,063,9522,879,0000524,288
2Sep 26, 2026 18:141,24411,473,6233,111,0000524,288
3Sep 26, 2026 18:141,25511,509,7843,139,0000524,288
4Sep 26, 2026 18:141,25611,505,8213,140,0000524,288
5Sep 26, 2026 18:141,25711,530,0903,143,0000524,288
6Sep 26, 2026 18:141,25911,636,8513,148,0000524,288
7Sep 26, 2026 18:141,26011,564,6293,152,0000524,288
8Sep 26, 2026 18:141,26111,567,6913,153,0000524,288
9Sep 26, 2026 18:141,26411,493,0613,160,0000524,288