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 listMay 5, 2026 19:19olliecrowolliecrowScore: 34,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 19:2134,058102,624,24782,948,0002,197,0002,387,968
2May 5, 2026 19:2134,06697,134,02682,936,0002,230,0002,387,968
3May 5, 2026 19:2134,16099,738,39883,357,0002,045,0002,375,680
4May 5, 2026 19:2134,168102,798,72383,331,0002,091,0002,387,968
5May 5, 2026 19:2134,175102,721,42683,379,0002,060,0002,371,584
6May 5, 2026 19:2134,203101,052,79383,377,0002,131,0002,383,872
7May 5, 2026 19:2134,21699,540,17583,439,0002,102,0002,387,968
8May 5, 2026 19:2134,22099,524,10183,404,0002,146,0002,392,064
9May 5, 2026 19:2134,238100,868,24783,499,0002,097,0002,392,064