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 listFeb 5, 2026 04:08Josu San MartinJosu San MartinScore: 5,488Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 04:085,46736,306,79710,514,0003,154,0002,527,232
2Feb 5, 2026 04:085,47641,398,46011,585,0002,106,0002,527,232
3Feb 5, 2026 04:085,47832,391,92110,534,0003,160,0002,523,136
4Feb 5, 2026 04:085,48440,823,39312,655,0001,054,0002,465,792
5Feb 5, 2026 04:085,48832,487,93912,665,0001,055,0002,527,232
6Feb 5, 2026 04:085,50333,090,62712,699,0001,058,0002,396,160
7Feb 5, 2026 04:085,56342,016,9619,934,0003,973,0002,531,328
8Feb 5, 2026 04:085,56434,259,6719,936,0003,974,0002,392,064
9Feb 5, 2026 04:085,56731,715,74311,929,0001,988,0002,392,064