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 18, 2026 17:10M-RochatM-RochatError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 17:100552,253,922536,261,0004,039,0002,113,536expected "1027208 ", got "1027207 "
2May 18, 2026 17:100539,417,624526,907,0003,011,0002,113,536expected "1025265 ", got "1025262 "
3May 18, 2026 17:100608,523,653592,291,0004,017,0002,113,536expected "1023396 ", got "1023393 "