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 listApr 21, 2026 09:19Dominique GarmierDominique GarmierError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 09:19045,599,22216,097,0005,030,0002,256,896pos 0: expected 226 got 248
2Apr 21, 2026 09:19048,350,92014,467,0006,200,0002,494,464pos 0: expected 231 got 236
3Apr 21, 2026 09:19044,477,04314,894,0005,957,0002,256,896pos 0: expected 192 got 233