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 listAug 1, 2026 14:51CodeReclaimersCodeReclaimersScore: 6,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 14:526,372220,362,901206,066,0004,226,0002,113,536
2Aug 1, 2026 14:526,387220,800,324206,581,0004,199,0002,113,536
3Aug 1, 2026 14:526,397221,858,307206,908,0004,196,0002,113,536
4Aug 1, 2026 14:526,398221,303,353206,800,0004,339,0002,113,536
5Aug 1, 2026 14:526,419221,980,681207,436,0004,421,0002,113,536
6Aug 1, 2026 14:526,424222,751,799207,532,0004,487,0002,113,536
7Aug 1, 2026 14:526,447222,828,361208,447,0004,313,0002,113,536
8Aug 1, 2026 14:526,468224,338,622209,109,0004,367,0002,113,536
9Aug 1, 2026 14:526,533225,720,797211,272,0004,330,0002,113,536