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 listJun 18, 2021 21:23alex3dalex3dScore: 63,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2021 21:2363,4592,163,442,2632,094,132,11202,240,512
2Jun 18, 2021 21:2363,6362,156,999,4512,099,997,95202,244,608
3Jun 18, 2021 21:2363,8452,171,276,9802,106,886,54602,277,376