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 11, 2026 21:06Victor MerckléVictor MerckléScore: 3,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 21:083,85319,431,9187,256,0002,377,0002,138,112
2May 11, 2026 21:083,85619,665,9677,263,0002,378,0002,138,112
3May 11, 2026 21:083,86719,341,8257,268,0002,400,0002,138,112
4May 11, 2026 21:083,86919,487,9997,298,0002,375,0002,138,112
5May 11, 2026 21:083,88917,016,7447,463,0002,260,0002,138,112
6May 11, 2026 21:083,88919,405,8687,187,0002,537,0002,142,208
7May 11, 2026 21:083,92619,884,9896,733,0003,082,0002,138,112
8May 11, 2026 21:084,00920,109,1867,657,0002,367,0002,142,208
9May 11, 2026 21:084,04118,409,1016,903,0003,200,0002,138,112