Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listDec 20, 2025 14:37Rajarshi BasuRajarshi BasuScore: 5,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 14:375,042195,183,961159,366,0007,016,0002,359,296
2Dec 20, 2025 14:375,043192,851,647161,395,0005,012,0002,523,136
3Dec 20, 2025 14:375,050193,013,335159,650,0006,984,0002,273,280
4Dec 20, 2025 14:375,075192,961,456162,494,0004,984,0002,519,040
5Dec 20, 2025 14:375,081196,682,850162,677,0004,990,0002,314,240
6Dec 20, 2025 14:375,087191,590,370163,881,0003,997,0002,519,040
7Dec 20, 2025 14:375,100194,450,061164,298,0004,007,0002,514,944
8Dec 20, 2025 14:375,116191,959,911161,823,0006,992,0002,318,336
9Dec 20, 2025 14:375,265197,110,260167,745,0005,990,0002,510,848