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 13, 2026 15:49limanjun99limanjun99Score: 3,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 15:492,97926,676,8725,320,0002,128,0002,293,760
2Apr 13, 2026 15:492,98424,805,3635,328,0002,131,0002,277,376
3Apr 13, 2026 15:492,99224,925,3765,343,0002,137,0002,293,760
4Apr 13, 2026 15:492,99423,744,3765,346,0002,138,0002,293,760
5Apr 13, 2026 15:493,11730,242,2165,567,0002,226,0002,277,376
6Apr 13, 2026 15:493,11825,615,9965,569,0002,227,0002,527,232
7Apr 13, 2026 15:493,15325,239,5505,912,0001,970,0002,514,944
8Apr 13, 2026 15:493,16628,991,5904,946,0002,968,0002,293,760
9Apr 13, 2026 15:493,16927,395,2115,942,0001,980,0002,514,944