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 08:50Rajarshi BasuRajarshi BasuScore: 5,230Success
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 08:505,220197,306,184167,246,0005,007,0002,523,136
2Dec 20, 2025 08:505,222194,825,814169,321,0003,005,0002,293,760
3Dec 20, 2025 08:505,224193,797,629166,381,0006,013,0002,523,136
4Dec 20, 2025 08:505,225203,125,009165,411,0007,017,0002,510,848
5Dec 20, 2025 08:505,230199,837,076167,590,0004,987,0002,293,760
6Dec 20, 2025 08:505,243206,281,684168,025,0005,000,0002,285,568
7Dec 20, 2025 08:505,271201,416,217167,941,0005,997,0002,519,040
8Dec 20, 2025 08:505,283201,489,025169,336,0005,009,0002,514,944
9Dec 20, 2025 08:505,347198,831,632169,477,0006,978,0002,351,104