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 listJan 22, 2025 01:50Gerard SmitGerard SmitScore: 219,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 01:50217,8507,214,087,1217,163,062,00025,985,0002,396,160
2Jan 22, 2025 01:50219,6927,283,444,4627,222,855,00026,984,0002,490,368
3Jan 22, 2025 01:50222,6407,378,969,1637,323,132,00023,984,0002,453,504