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 22, 2025 19:35zielajzielajScore: 4,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 19:354,393168,647,642133,967,00010,997,0002,318,336
2Dec 22, 2025 19:354,396167,867,979136,075,0009,004,0002,375,680
3Dec 22, 2025 19:354,402163,938,470134,255,00011,020,0002,531,328
4Dec 22, 2025 19:354,418170,525,876134,817,00010,985,0002,408,448
5Dec 22, 2025 19:354,427168,770,496132,082,00014,008,0002,318,336
6Dec 22, 2025 19:354,431170,323,258138,208,0008,012,0002,310,144
7Dec 22, 2025 19:354,453168,378,188135,958,00010,996,0002,322,432
8Dec 22, 2025 19:354,464170,363,866138,297,0009,019,0002,326,528
9Dec 22, 2025 19:354,554175,139,596136,267,00014,027,0002,338,816