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 05:06limanjun99limanjun99Score: 4,191Success
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 05:064,13627,298,7437,239,0003,102,0002,510,848
2Apr 13, 2026 05:064,15025,730,9377,262,0003,112,0002,375,680
3Apr 13, 2026 05:064,15234,839,6588,304,0002,076,0002,293,760
4Apr 13, 2026 05:064,15331,088,6728,307,0002,076,0002,297,856
5Apr 13, 2026 05:064,19128,589,9667,335,0003,143,0002,527,232
6Apr 13, 2026 05:064,19527,769,6288,390,0002,097,0002,289,664
7Apr 13, 2026 05:064,20732,012,1117,362,0003,155,0002,510,848
8Apr 13, 2026 05:064,22826,783,3726,343,0004,228,0002,342,912
9Apr 13, 2026 05:064,25631,005,2478,512,0002,128,0002,285,568