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 28, 2026 21:20olliecrowolliecrowScore: 3,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 21:233,74430,152,2857,282,0002,080,0002,453,504
2Apr 28, 2026 21:233,78729,581,0106,313,0003,156,0002,338,816
3Apr 28, 2026 21:233,93426,023,2576,885,0002,950,0002,375,680
4Apr 28, 2026 21:233,93726,996,0358,860,000984,0002,375,680
5Apr 28, 2026 21:233,95229,336,4806,917,0002,964,0002,375,680
6Apr 28, 2026 21:233,95728,179,5287,915,0001,978,0002,379,776
7Apr 28, 2026 21:234,00225,207,8249,005,0001,000,0002,375,680
8Apr 28, 2026 21:234,02629,214,7168,052,0002,013,0002,441,216
9Apr 28, 2026 21:234,26230,826,5298,524,0002,131,0002,371,584