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 listMar 24, 2026 11:13Dominique GarmierDominique GarmierScore: 61,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 11:1361,3362,055,494,2592,011,104,00012,994,0002,347,008
2Mar 24, 2026 11:1361,6502,062,614,9672,023,462,00010,997,0002,347,008
3Mar 24, 2026 11:1362,3902,085,484,3222,043,885,00014,999,0002,347,008