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 30, 2026 02:46Victor MerckléVictor MerckléScore: 2,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 02:482,52215,519,9584,976,0001,331,0002,113,536
2May 30, 2026 02:482,52614,062,9734,985,0001,331,0002,113,536
3May 30, 2026 02:482,52916,235,4874,990,0001,334,0002,113,536
4May 30, 2026 02:482,53114,245,2024,994,0001,334,0002,113,536
5May 30, 2026 02:482,53214,299,3724,997,0001,333,0002,113,536
6May 30, 2026 02:482,54114,139,9175,020,0001,334,0002,113,536
7May 30, 2026 02:482,57717,153,5195,084,0001,359,0002,113,536
8May 30, 2026 02:482,59216,321,6595,112,0001,370,0002,113,536
9May 30, 2026 02:482,64614,291,2884,337,0002,278,0002,113,536