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 listOct 13, 2024 13:32Vladimir TatVladimir TatScore: 231,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 13:32228,4727,576,123,1547,517,600,00021,987,0002,387,968
2Oct 13, 2024 13:32231,6307,681,164,9247,624,794,00018,989,0002,342,912
3Oct 13, 2024 13:32234,9627,785,912,3837,734,774,00018,987,0002,531,328