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 22, 2026 12:58M-RochatM-RochatScore: 4,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 12:584,46320,704,08210,073,0001,085,0002,121,728
2May 22, 2026 12:584,46520,325,25310,078,0001,085,0002,117,632
3May 22, 2026 12:584,46622,188,00510,085,0001,082,0002,117,632
4May 22, 2026 12:584,47020,306,10310,093,0001,084,0002,117,632
5May 22, 2026 12:584,47220,348,25010,096,0001,084,0002,117,632
6May 22, 2026 12:584,47420,321,67810,103,0001,084,0002,117,632
7May 22, 2026 12:584,47620,331,23210,107,0001,083,0002,117,632
8May 22, 2026 12:584,48720,372,04810,138,0001,081,0002,117,632
9May 22, 2026 12:584,52220,414,67310,209,0001,098,0002,117,632