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 listMar 12, 2026 03:20olliecrowolliecrowScore: 8,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 03:208,67449,922,49020,652,0001,032,0002,387,968
2Mar 12, 2026 03:208,69852,232,52120,711,0001,035,0002,494,464
3Mar 12, 2026 03:208,76448,583,95221,909,00002,498,560