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 listJul 18, 2026 19:17Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 19:1802,715,975,8692,598,127,000107,840,0002,113,536expected "1020947 ", got "1020947 max collisions: 3 "
2Jul 18, 2026 19:1802,715,595,4702,604,902,000100,217,0002,113,536expected "1019480 ", got "1019480 max collisions: 4 "
3Jul 18, 2026 19:1802,733,222,9042,625,349,00097,340,0002,113,536expected "1018615 ", got "1018615 max collisions: 4 "