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 19, 2025 18:16Rajarshi BasuRajarshi BasuScore: 6,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 18:165,971223,009,520191,028,0006,000,0002,338,816
2Dec 19, 2025 18:155,979223,373,611193,302,0004,006,0002,498,560
3Dec 19, 2025 18:165,981224,560,013193,374,0004,007,0002,510,848
4Dec 19, 2025 18:155,988223,542,164191,625,0005,988,0002,396,160
5Dec 19, 2025 18:166,005226,932,130192,176,0006,005,0002,523,136
6Dec 19, 2025 18:166,013224,665,525192,424,0006,013,0002,514,944
7Dec 19, 2025 18:166,030220,624,464193,998,0004,999,0002,363,392
8Dec 19, 2025 18:156,047229,244,969193,557,0005,986,0002,510,848
9Dec 19, 2025 18:166,213227,948,549199,016,0006,000,0002,514,944