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 14:58limanjun99limanjun99Score: 3,065Success
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 14:583,03424,149,0345,418,0002,167,0002,293,760
2Apr 13, 2026 14:583,03724,761,1245,423,0002,169,0002,293,760
3Apr 13, 2026 14:583,04924,244,4555,445,0002,178,0002,527,232
4Apr 13, 2026 14:583,06221,957,5505,469,0002,187,0002,363,392
5Apr 13, 2026 14:583,06522,851,4785,473,0002,189,0002,277,376
6Apr 13, 2026 14:583,07823,359,1266,596,0001,099,0002,363,392
7Apr 13, 2026 14:583,17329,070,1164,958,0002,975,0002,285,568
8Apr 13, 2026 14:583,17426,788,7854,959,0002,975,0002,273,280
9Apr 13, 2026 14:583,17527,406,8615,954,0001,984,0002,293,760