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 4, 2026 23:53olliecrowolliecrowScore: 4,068Success
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 00:023,73523,934,3338,178,0001,161,0002,363,392
2May 5, 2026 00:023,77625,104,9298,271,0001,171,0002,379,776
3May 5, 2026 00:023,80223,874,2078,323,0001,182,0002,363,392
4May 5, 2026 00:024,04426,452,6777,859,0002,252,0002,371,584
5May 5, 2026 00:024,06828,690,5807,914,0002,256,0002,367,488
6May 5, 2026 00:024,07027,969,6747,875,0002,302,0002,371,584
7May 5, 2026 00:024,07226,770,2997,826,0002,354,0002,367,488
8May 5, 2026 00:024,09228,709,1577,907,0002,325,0002,375,680
9May 5, 2026 00:024,18837,625,2178,008,0002,463,0002,371,584