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 29, 2026 23:43Victor MerckléVictor MerckléScore: 2,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:452,51915,482,1004,971,0001,328,0002,113,536
2May 29, 2026 23:452,52616,272,3654,986,0001,331,0002,113,536
3May 29, 2026 23:452,52617,291,7414,986,0001,331,0002,113,536
4May 29, 2026 23:452,53914,309,6415,016,0001,332,0002,113,536
5May 29, 2026 23:452,54814,818,6175,028,0001,343,0002,113,536
6May 29, 2026 23:452,55817,208,5055,049,0001,348,0002,113,536
7May 29, 2026 23:452,58817,238,0345,145,0001,326,0002,113,536
8May 29, 2026 23:452,59115,304,2025,115,0001,363,0002,113,536
9May 29, 2026 23:452,62817,068,0225,246,0001,325,0002,113,536