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 25, 2022 12:16Bernard TeoBernard TeoScore: 16,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2022 12:1615,974613,949,988527,148,61002,277,376
2Aug 25, 2022 12:1616,049588,634,255529,617,93202,289,664
3Aug 25, 2022 12:1616,065588,505,082530,152,47802,277,376
4Aug 25, 2022 12:1616,102604,757,601531,352,83102,273,280
5Aug 25, 2022 12:1616,261599,116,620536,611,60902,277,376
6Aug 25, 2022 12:1616,944636,406,333559,146,43102,273,280