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 4, 2026 20:21olliecrowolliecrowScore: 25,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 20:2125,12488,578,71155,831,0006,978,0002,269,184
2Mar 4, 2026 20:2125,20788,833,63356,016,0007,002,0002,289,664
3Mar 4, 2026 20:2125,53392,827,89054,857,0008,976,0002,322,432