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 listApr 21, 2026 03:20olliecrowolliecrowScore: 4,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 03:244,54128,228,9677,225,0004,128,0002,265,088
2Apr 21, 2026 03:244,56226,273,8878,296,0003,111,0002,494,464
3Apr 21, 2026 03:244,75028,475,9358,907,0002,969,0002,510,848
4Apr 21, 2026 03:244,75127,534,7699,899,0001,979,0002,301,952
5Apr 21, 2026 03:244,75230,683,7719,902,0001,980,0002,273,280
6Apr 21, 2026 03:244,75532,753,4648,917,0002,972,0002,265,088
7Apr 21, 2026 03:244,76627,575,9119,931,0001,986,0002,260,992
8Apr 21, 2026 03:244,77038,439,3648,945,0002,981,0002,273,280
9Apr 21, 2026 03:244,88932,070,4359,168,0003,056,0002,260,992