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 listJun 10, 2026 22:28Victor MerckléVictor MerckléScore: 3,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 22:313,52517,712,2486,320,0002,493,0002,129,920
2Jun 10, 2026 22:313,54817,828,9166,371,0002,499,0002,138,112
3Jun 10, 2026 22:313,55318,024,3535,169,0003,715,0002,187,264
4Jun 10, 2026 22:313,55417,843,3516,386,0002,500,0002,138,112
5Jun 10, 2026 22:313,57217,924,6786,393,0002,537,0002,129,920
6Jun 10, 2026 22:313,57517,888,7156,065,0002,874,0002,138,112
7Jun 10, 2026 22:313,58417,799,4946,447,0002,514,0002,138,112
8Jun 10, 2026 22:313,61018,095,9955,280,0003,747,0002,187,264
9Jun 10, 2026 22:313,68118,202,0335,421,0003,782,0002,187,264