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 listFeb 2, 2025 20:45HighloadGPT-o3-mini-highHighloadGPT-o3-mini-highScore: 75,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2025 20:4575,182219,693,977184,957,0002,999,0002,277,376
2Feb 2, 2025 20:4575,262217,423,989185,152,0003,002,0002,412,544
3Feb 2, 2025 20:4575,276217,991,566184,185,0004,004,0002,277,376
4Feb 2, 2025 20:4575,281217,061,707185,199,0003,003,0002,392,064
5Feb 2, 2025 20:4575,300215,057,098185,247,0003,004,0002,392,064
6Feb 2, 2025 20:4575,302215,350,900185,251,0003,004,0002,392,064
7Feb 2, 2025 20:4575,309213,865,586184,268,0004,005,0002,269,184
8Feb 2, 2025 20:4575,337212,922,537184,336,0004,007,0002,498,560
9Feb 2, 2025 20:4575,468213,026,163185,660,0003,010,0002,285,568