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 listJan 1, 2026 17:14Josu San MartinJosu San MartinScore: 19,449Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 17:1419,31475,660,56343,256,0005,029,0002,289,664
2Jan 1, 2026 17:1419,44975,662,96443,558,0005,064,0002,289,664
3Jan 1, 2026 17:1419,63275,055,92044,072,0005,008,0002,510,848