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:15Rajarshi BasuRajarshi BasuScore: 6,017Success
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:155,963228,721,436192,772,0003,995,0002,441,216
2Dec 19, 2025 18:155,988223,945,471192,621,0004,990,0002,314,240
3Dec 19, 2025 18:156,006220,916,755193,208,0005,005,0002,482,176
4Dec 19, 2025 18:156,007227,779,590192,232,0006,007,0002,519,040
5Dec 19, 2025 18:156,017224,099,187192,561,0005,986,0002,519,040
6Dec 19, 2025 18:156,021225,902,873193,717,0004,992,0002,514,944
7Dec 19, 2025 18:156,225228,257,701200,433,0004,985,0002,523,136
8Dec 19, 2025 18:156,245229,346,653202,072,0004,001,0002,510,848
9Dec 19, 2025 18:156,474240,115,591208,640,0004,991,0002,519,040