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 listJun 21, 2026 17:28A_ShamanA_ShamanScore: 21,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:2921,14461,978,71949,559,0003,301,0002,113,536
2Jun 21, 2026 17:2921,25962,391,82749,840,0003,309,0002,113,536
3Jun 21, 2026 17:2921,28162,520,79549,871,0003,332,0002,113,536
4Jun 21, 2026 17:2921,29762,469,04549,794,0003,450,0002,113,536
5Jun 21, 2026 17:2921,31463,769,45549,933,0003,354,0002,113,536
6Jun 21, 2026 17:2921,34262,617,05249,946,0003,409,0002,113,536
7Jun 21, 2026 17:2921,36262,601,97850,078,0003,328,0002,113,536
8Jun 21, 2026 17:2921,39763,021,09849,261,0004,232,0002,113,536
9Jun 21, 2026 17:2921,49962,898,28349,467,0004,282,0002,113,536