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 listMay 13, 2026 04:52Josu San MartinJosu San MartinScore: 3,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 04:533,511127,604,298114,856,0001,038,0002,113,536
2May 13, 2026 04:533,519124,891,353115,008,0001,128,0002,113,536
3May 13, 2026 04:533,520127,515,650115,062,0001,114,0002,113,536
4May 13, 2026 04:533,522125,315,376115,134,0001,112,0002,113,536
5May 13, 2026 04:533,523125,014,127115,180,0001,100,0002,113,536
6May 13, 2026 04:533,525126,992,411115,289,0001,046,0002,113,536
7May 13, 2026 04:533,526126,309,613115,250,0001,138,0002,113,536
8May 13, 2026 04:533,529128,252,497115,348,0001,126,0002,113,536
9May 13, 2026 04:533,530128,454,004115,368,0001,132,0002,113,536