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 5, 2026 03:41olliecrowolliecrowScore: 3,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 03:443,72126,587,5787,103,0002,201,0002,375,680
2May 5, 2026 03:443,76928,446,0127,224,0002,199,0002,375,680
3May 5, 2026 03:443,80426,794,9997,266,0002,244,0002,367,488
4May 5, 2026 03:443,85926,543,9117,378,0002,270,0002,379,776
5May 5, 2026 03:443,88224,314,5527,458,0002,248,0002,363,392
6May 5, 2026 03:443,90527,064,8257,526,0002,237,0002,383,872
7May 5, 2026 03:443,93728,253,2287,591,0002,253,0002,371,584
8May 5, 2026 03:443,94427,934,3687,641,0002,221,0002,375,680
9May 5, 2026 03:443,98830,468,2027,613,0002,359,0002,379,776